A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem

DOI10.1016/0305-0548(90)90009-VzbMath0699.90061OpenAlexW2165586436MaRDI QIDQ913649

Cheng, T. C. Edwin

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90009-v

zbMATH Keywords

sequencingsimultaneously available jobscommon-due-dateearliness and tardiness valuessingle- machine

Mathematics Subject Classification ID

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

Related Items (6)

Common due-date determination and sequencing using tabu search ⋮ Single-machine sequencing with controllable processing times ⋮ A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date ⋮ Common due date scheduling problem with separate earliness and tardiness penalties ⋮ A fuzzy-linguistic approach to a multi-criteria sequencing problem ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• An algorithm for the CON due-date determination and sequencing problem
• Survey of scheduling research involving due date determination decisions
• On Optimal Common Due-Date Determination

This page was built for publication: A note on a partial search algorithm for the single-machine optimal common due-date assignment and sequencing problem