Earliness-Tardiness Scheduling Around Almost Equal Due Dates

DOI10.1287/ijoc.9.1.92zbMath0889.90089OpenAlexW1983314600MaRDI QIDQ4367046

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

Publication date: 15 January 1998

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/04bd450f2ff5b2c12d45eaec7aa3bee7f0cd7b98

zbMATH Keywords

machine schedulingearliness-tardiness penaltiescommon due date problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Machine scheduling with earliness, tardiness and non-execution penalties ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem ⋮ Multicriteria scheduling ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research