Earliness-tardiness scheduling around almost equal due dates

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

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)

Abstract

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
Volume9
Issue number1
DOIs
Publication statusPublished - 1997

Keywords

  • Production scheduling
  • Sequencing
  • Deterministic models

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

Cite this