Multi-machine scheduling with linear deterioration

Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

96 Scopus citations

Abstract

We study multi-machine makespan minimization of deteriorating jobs, i.e. jobs whose processing times are increasing functions of their starting times. We assume simple linear deterioration, and parallel identical machines. The problem is proven to be NP-hard even for two machines. A heuristic and lower bound are introduced and tested numerically. The heuristic is shown to be asymptotically optimal under very general conditions. We also study a non-conventional performance measure relevant to settings with deteriorating jobs, namely, minimum total load on all machines.

Original languageAmerican English
Pages (from-to)205-214
Number of pages10
JournalINFOR
Volume36
Issue number4
DOIs
StatePublished - Nov 1998

Keywords

  • Deteriorating jobs
  • Deterministic scheduling
  • Heuristics
  • Multiple machine

Fingerprint

Dive into the research topics of 'Multi-machine scheduling with linear deterioration'. Together they form a unique fingerprint.

Cite this