A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Nir Halman

doi:10.1007/s10951-019-00616-8

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Nir Halman

Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

Fully polynomial time approximation schemes for scheduling deteriorating jobs with nonlinear processing times on a single machine are given via an application of the K-approximation sets and functions technique.

Original language	English
Pages (from-to)	643-648
Number of pages	6
Journal	Journal of Scheduling
Volume	23
Issue number	6
DOIs	https://doi.org/10.1007/s10951-019-00616-8
State	Published - Dec 2020
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.

Funding

This work is supported in part by the Israel Science Foundation, Grant No. 399/17, and by the United States–Israel Binational Science Foundation (BSF), Jerusalem, Israel. The author thanks the anonymous referees for their valuable comments and Stanislaw Gawiejnowicz for fruitful discussions. This work is supported in part by the Israel Science Foundation, Grant No. 399/17, and by the United States?Israel Binational Science Foundation (BSF), Jerusalem, Israel. The author thanks the anonymous referees for their valuable comments and Stanislaw Gawiejnowicz for fruitful discussions.

Funders	Funder number
United States - Israel Binational Science Foundation
United States-Israel Binational Science Foundation
Israel Science Foundation	399/17

Keywords

Dynamic scheduling
FPTAS
K-approximation sets and functions

Access to Document

10.1007/s10951-019-00616-8

Cite this

@article{86b72b7a5e064c4eb13174f97f7a3e4c,

title = "A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times",

abstract = "Fully polynomial time approximation schemes for scheduling deteriorating jobs with nonlinear processing times on a single machine are given via an application of the K-approximation sets and functions technique.",

keywords = "Dynamic scheduling, FPTAS, K-approximation sets and functions",

author = "Nir Halman",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2020",

month = dec,

doi = "10.1007/s10951-019-00616-8",

language = "אנגלית",

volume = "23",

pages = "643--648",

journal = "Journal of Scheduling",

issn = "1094-6136",

publisher = "Springer New York",

number = "6",

}

TY - JOUR

T1 - A technical note

T2 - fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

AU - Halman, Nir

PY - 2020/12

Y1 - 2020/12

N2 - Fully polynomial time approximation schemes for scheduling deteriorating jobs with nonlinear processing times on a single machine are given via an application of the K-approximation sets and functions technique.

AB - Fully polynomial time approximation schemes for scheduling deteriorating jobs with nonlinear processing times on a single machine are given via an application of the K-approximation sets and functions technique.

KW - Dynamic scheduling

KW - FPTAS

KW - K-approximation sets and functions

UR - http://www.scopus.com/inward/record.url?scp=85096510313&partnerID=8YFLogxK

U2 - 10.1007/s10951-019-00616-8

DO - 10.1007/s10951-019-00616-8

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85096510313

SN - 1094-6136

VL - 23

SP - 643

EP - 648

JO - Journal of Scheduling

JF - Journal of Scheduling

IS - 6

ER -

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this