A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date

Shih Wei Lin, Shuo Yan Chou*, Kuo Ching Ying

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

38 Scopus citations

Abstract

This study focuses on a class of single-machine scheduling problems with a common due date where the objective is to minimize the total earliness-tardiness penalty for the jobs. A sequential exchange approach utilizing a job exchange procedure and three previously established properties in common due date scheduling was developed and tested with a set of benchmark problems. The developed approach generates results better than not only those of the existing dedicated heuristics but also in many cases those of meta-heuristic approaches. And the developed approach performs consistently well in various job settings with respect to the number of jobs, processing time and earliness-tardiness penalties for the jobs.

Original languageEnglish
Pages (from-to)1294-1301
Number of pages8
JournalEuropean Journal of Operational Research
Volume177
Issue number2
DOIs
StatePublished - 01 03 2006
Externally publishedYes

Keywords

  • Common due date
  • Earliness-tardiness penalties
  • Heuristics
  • Scheduling
  • Single-machine

Fingerprint

Dive into the research topics of 'A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date'. Together they form a unique fingerprint.

Cite this