An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs

DOI10.1016/j.cor.2007.03.006zbMath1170.90395OpenAlexW2014257991WikidataQ126269522 ScholiaQ126269522MaRDI QIDQ2483505

Gur Mosheiov, Chung-Lun Li, Uri Yovel

Publication date: 28 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1842

zbMATH Keywords

schedulingearliness-tardinessanalysis of algorithmsdue-date assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, Scheduling problems with two competing agents to minimized weighted earliness-tardiness, Soft due window assignment and scheduling of unit-time jobs on parallel machines, Due-window assignment problems with unit-time jobs

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
• The parallel machine min-max weighted absolute lateness scheduling problem