Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints

Shih Wei Lin, Chung-Cheng Lu, Kuo Ching Ying*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

39 Scopus citations

Abstract

The unrelated parallel machine scheduling problem with sequence- and machine-dependent setup times in the presence of due date constraints represents an important but relatively less-studied scheduling problem in the literature. In this study, a simple iterated greedy (IG) heuristic is presented to minimize the total tardiness of this scheduling problem. The effectiveness and efficiency of the proposed IG heuristic are compared with existing algorithms on a benchmark problem dataset used in earlier studies. Extensive computational results indicate that the proposed IG heuristic is capable of obtaining significantly better solutions than the state-of-the-art algorithms on the same benchmark problem dataset with similar computational resources.

Original languageEnglish
Pages (from-to)353-361
Number of pages9
JournalInternational Journal of Advanced Manufacturing Technology
Volume53
Issue number1-4
DOIs
StatePublished - 1 Mar 2011

Keywords

  • Due date constraints
  • Machine-dependent setup times
  • Sequence-dependent setup times
  • Total tardiness
  • Unrelated parallel machines

Fingerprint Dive into the research topics of 'Minimization of total tardiness on unrelated parallel machines with sequence- and machine-dependent setup times under due date constraints'. Together they form a unique fingerprint.

Cite this