Optimal common due-date with completion time tolerance

DOI10.1016/S0305-0548(96)00020-2zbMath0873.90057OpenAlexW1993099652MaRDI QIDQ1360136

Sheldon Epstein, Yonah Wilamowsky, Bernard Dickman

Publication date: 19 August 1997

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00020-2

zbMATH Keywords

polynomial time solution algorithmcommon due-date problemvariety of penalty functions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on scheduling problems with due windows ⋮ On scheduling around large restrictive common due windows ⋮ Multiple common due dates ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Optimal common due-date with limited completion time
• Optimal common due-date with limited completion time deviation
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date