A note on the complexity of flow-shop scheduling with deteriorating jobs
Journal article, 2011

This paper is a note on “Complexity analysis of job-shop scheduling with deteriorating jobs” [G. Mosheiov, Complexity analysis of job-shop scheduling with deteriorating jobs, Discrete Applied Mathematics 117 (2002) 195–209]. A proportional deterioration rate is assumed and the objective is the minimization of the makespan. Mosheiov presents NP-hardness results for flow-shops and open-shops with three or more machines and for job-shops with two or more machines. The proof of NP-hardness for the flow-shop case is however not correct. This paper provides a correct proof.

Deteriorating jobs

NP-hardness

Makespan

Flow shop

Author

Karin Thörnblad

University of Gothenburg

Chalmers, Mathematical Sciences, Mathematics

Michael Patriksson

Chalmers, Mathematical Sciences, Mathematics

University of Gothenburg

Discrete Applied Mathematics

0166-218X (ISSN)

Vol. 159 4 251-253

Areas of Advance

Transport

Production

Subject Categories

Computational Mathematics

Roots

Basic sciences

DOI

10.1016/j.dam.2010.11.006

More information

Created

10/7/2017