A Generalized Model of Optimal Due-Date Assignment by Linear Programming

DOI10.2307/2582060zbMath0608.90045OpenAlexW4253549191MaRDI QIDQ3748046

M. A. Quaddus

Publication date: 1987

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582060

zbMATH Keywords

dualitysingle machineindependent jobsoptimal due-date assignmentCON due-dateconstant-allowance due-date

Mathematics Subject Classification ID

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

Related Items

Scheduling with monotonous earliness and tardiness penalties ⋮ Minimizing flowtime and missed due-dates in single-machine sequencing ⋮ Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing ⋮ 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 ⋮ A composite heuristic for the single machine early/tardy job scheduling problem. ⋮ CON due-date determination and sequencing ⋮ Dynamic programming approach to the single-machine sequencing problem with different due-dates ⋮ Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine ⋮ 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 ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research