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

DOI10.1016/0898-1221(87)90136-2MaRDI QIDQ1098766zbMATH OpenOpenAlexWikidataFDO

Authors T. C. Edwin Cheng

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3724172 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• A Simulation Study of Predictable Due-Dates
• Analytical determination of optimal TWK due-dates in a job shop
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Due Date Assignment for Production Systems
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine

Cited in

(12)

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

This page was built for publication: Minimizing the maximum deviation of job completion time about a common due-date

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