On the fixed interval due-date scheduling problem

DOI10.1016/0166-218X(95)00049-WzbMath0846.90051OpenAlexW2050539655MaRDI QIDQ1917349

Chung-Lun Li, Chung-Yee Lee

Publication date: 3 October 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00049-w

zbMATH Keywords

heuristicworst-case analysisstrongly NP-hardpseudo-polynomial dynamic programming algorithmnonpreemptive single machine schedulingmultiple due-datestotal due-date costtotal earliness cost

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Finding efficient make-to-order production and batch delivery schedules ⋮ Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty

Cites Work

• Unnamed Item
• Unnamed Item
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs
• A fixed interval due-date scheduling problem with earliness and due-date costs
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization
• Minimizing Job Idleness in Deadline Constrained Environments

This page was built for publication: On the fixed interval due-date scheduling problem