Complexity analysis of job-shop scheduling with deteriorating jobs

Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

93 Scopus citations

Abstract

This paper addresses job-shop scheduling problems with deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting time. A simple linear deterioration is assumed and our objective is makespan minimization. We provide a complete analysis of the complexity of flow-shops, open-shops and job-shop problems. We introduce a polynomial-time algorithm for the two-machine flow-shop, and prove NP-hardness when an arbitrary number of machines (three and above) is assumed. Similarly, we introduce a polynomial-time algorithm for the two-machine open-shop, and prove NP-hardness when an arbitrary number of machines (three and above) is assumed. Finally, we prove NP-hardness of the job-shop problem even for two machines.

Original languageAmerican English
Pages (from-to)195-209
Number of pages15
JournalDiscrete Applied Mathematics
Volume117
Issue number1-3
DOIs
StatePublished - 15 Mar 2002

Bibliographical note

Funding Information:
I want to thank Dina Sher for preparing the graphs. This paper was supported in part by the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Deteriorating jobs
  • Deterministic scheduling
  • Flow-shop
  • Job-shop
  • Open-shop

Fingerprint

Dive into the research topics of 'Complexity analysis of job-shop scheduling with deteriorating jobs'. Together they form a unique fingerprint.

Cite this