Earliness-tardiness scheduling around almost equal due dates

J.A. Hoogeveen, S.L. van de Velde

Research output: Contribution to journalArticleAcademicpeer-review

14 Citations (Scopus)
2 Downloads (Pure)


Discusses the existence of another class of problems that are structurally less complicated than the general earliness-tardiness problem. Details of common due date problems; Logic behind Emmons' matching algorithm; List of earliness-tardiness problems to which the optimality principle of the dynamic algorithm applies; Properties that apply to the variants of dynamic programming.
Original languageEnglish
Pages (from-to)92-99
JournalINFORMS journal on computing
Issue number1
Publication statusPublished - 1997


  • Production scheduling
  • Sequencing
  • Deterministic models


Dive into the research topics of 'Earliness-tardiness scheduling around almost equal due dates'. Together they form a unique fingerprint.

Cite this