An algorithm for the CON due-date determination and sequencing problem

DOI10.1016/0305-0548(87)90048-7zbMath0634.90030OpenAlexW2107556590MaRDI QIDQ1097162

Cheng, T. C. Edwin

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90048-7

zbMATH Keywords

due-date assignmentoptimal sequencecommon starting timesdeterministic processing timesoptimal constant flow allowanceweighted average of missed due-dates

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (20)

Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ A minimax job completion-time problem revisited ⋮ 0-1 Quadratic programming approach for optimum solutions of two scheduling problems ⋮ Survey of scheduling research involving due date determination decisions ⋮ Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties ⋮ Single machine scheduling with common due data assignment in a group technology environment ⋮ Common due-date determination and sequencing using tabu search ⋮ Mimimization of agreeably weighted variance in single machine systems ⋮ New approaches to due date assignment in job shops ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ CON due-date determination and sequencing ⋮ A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem ⋮ Minimization of total absolute deviation for a common due date ⋮ Scheduling to minimize weighted earliness and tardiness about a common due-date ⋮ Optimal due-date assignment and sequencing ⋮ Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs ⋮ Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs ⋮ Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ Single-machine scheduling to minimize earliness and number of tardy jobs

Cites Work

• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Minimizing the average deviation of job completion times about a common due date
• Optimal due-date assignment in a job shop†
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• A Simulation Study of Predictable Due-Dates

This page was built for publication: An algorithm for the CON due-date determination and sequencing problem