Minimizing the maximum deviation of job completion time about a common due-date

DOI10.1016/0898-1221(87)90136-2zbMath0636.90045OpenAlexW1999287958WikidataQ115926653 ScholiaQ115926653MaRDI QIDQ1098766

Cheng, T. C. Edwin

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90136-2

zbMATH Keywords

separabilityconvexity spacedeterministic processing timesoptimal common due-dateoptimal job sequences

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

A minimax job completion-time problem revisited, A note on ``Minimizing the maximum deviation of job completion time about a common due-date, A note: minmax due-date assignment problem with lead-time cost, Survey of scheduling research involving due date determination decisions, Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints, Minmax due-date assignment with a time window for acceptable lead-times, Minmax due-date assignment on a two-machine flowshop, On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates, A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Analytical determination of optimal TWK due-dates in a job shop
• Due Date Assignment for Production Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• A Simulation Study of Predictable Due-Dates