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

DOI10.1016/0377-2217(88)90334-7MaRDI QIDQ1107429zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng

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

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

Review text

For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due- date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.

Recommendations

• A Note on the Common Due-Date Assignment Problem
• Optimal common due-date with limited completion time
• On Optimal Common Due-Date Determination
• A note on ``Minimizing the maximum deviation of job completion time about a common due-date
• On a single-machine optimal constant due-date assignment and sequencing problem

Cites work

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

Cited in

(12)

• A note on ``Minimizing the maximum deviation of job completion time about a common due-date
• Survey of scheduling research involving due date determination decisions
• On the general solution for a class of early/tardy problems
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Scheduling under a common due-date on parallel unrelated machines
• Single machine scheduling with common due data assignment in a group technology environment
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• A Note on the Common Due-Date Assignment Problem
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
• Optimal common due-date with limited completion time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107429)