An alternative proof of optimality for the common due-date assignment problem

DOI10.1016/0377-2217(88)90334-7zbMath0652.90059OpenAlexW2106427660MaRDI QIDQ1107429

Cheng, T. C. Edwin

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90334-7

zbMATH Keywords

alternative proofcommon due-datesconstrained convex programmingKuhn- Tucker's optimality conditionsn-job, one-machine scheduling

Mathematics Subject Classification ID

Convex programming (90C25) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Survey of scheduling research involving due date determination decisions ⋮ Single machine scheduling with common due data assignment in a group technology environment ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ On the general solution for a class of early/tardy problems ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems ⋮ Scheduling under a common due-date on parallel unrelated machines ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Minimizing mean absolute deviation of completion times about a common due date
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

This page was built for publication: An alternative proof of optimality for the common due-date assignment problem