A heuristic for the single machine tardiness problem

S. S. Panwalkar, M. L. Smith, C. P. Koulamas

Research output: Contribution to journalArticlepeer-review

69 Scopus citations

Abstract

A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time.

Original languageEnglish
Pages (from-to)304-310
Number of pages7
JournalEuropean Journal of Operational Research
Volume70
Issue number3
DOIs
StatePublished - Nov 12 1993

Keywords

  • Scheduling
  • Single machine
  • Tardiness

Fingerprint Dive into the research topics of 'A heuristic for the single machine tardiness problem'. Together they form a unique fingerprint.

Cite this