On the fixed interval due-date scheduling problem
From MaRDI portal
Publication:1917349
DOI10.1016/0166-218X(95)00049-WzbMath0846.90051MaRDI QIDQ1917349
Publication date: 3 October 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
heuristic; worst-case analysis; strongly NP-hard; pseudo-polynomial dynamic programming algorithm; nonpreemptive single machine scheduling; multiple due-dates; total due-date cost; total earliness cost
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
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