An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration

Ming Liu (), Feifeng Zheng, Chengbin Chu and Jiantong Zhang
Additional contact information
Ming Liu: Tongji University
Feifeng Zheng: Xi’an Jiaotong University
Chengbin Chu: Ecole Centrale Paris
Jiantong Zhang: Tongji University

Journal of Combinatorial Optimization, 2012, vol. 23, issue 4, No 7, 483-492

Abstract: Abstract This paper consider m uniform (parallel) machine scheduling with linear deterioration to minimize the makespan. In an uniform machine environment, all machines have different processing speeds. Linear deterioration means that job’s actual processing time is a linear increasing function on its execution starting time. We propose a fully polynomial-time approximation scheme (FPTAS) to show the problem is NP-hard in the ordinary sense.

Keywords: Scheduling; Uniform machine; Linear deterioration; Makespan; FPTAS (search for similar items in EconPapers)
Date: 2012
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/s10878-010-9364-0 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:jcomop:v:23:y:2012:i:4:d:10.1007_s10878-010-9364-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9364-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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