Optimal assignment of slack due-dates and sequencing in a single-machine shop

DOI10.1016/0893-9659(89)90081-5zbMath0704.90044OpenAlexW2004021571MaRDI QIDQ917429

Cheng, T. C. Edwin

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90081-5

zbMATH Keywords

sequencingsingle-machineoptimal assignmentmaximum job tardinessslack due-dates

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Optimal assignment of due-dates for preemptive single-machine scheduling ⋮ A note: minmax due-date assignment problem with lead-time cost ⋮ Optimal assignment of NOP due-dates and sequencing in a single machine shop ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method ⋮ A note on optimal assignment of slack due-dates in single-machine scheduling ⋮ Optimal assignment of slack due-date and sequencing in a single machine shop

Cites Work

• Survey of scheduling research involving due date determination decisions
• A Survey of Scheduling Rules
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Optimal assignment of slack due-dates and sequencing in a single-machine shop