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

Nir Halman ()
Additional contact information
Nir Halman: Hebrew University of Jerusalem

Journal of Scheduling, 2020, vol. 23, issue 6, No 3, 643-648

Abstract: 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 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-019-00616-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:23:y:2020:i:6:d:10.1007_s10951-019-00616-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-019-00616-8

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().