Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

DOI10.1016/S0377-2217(98)00196-9zbMath1009.90041MaRDI QIDQ1610141

Cheng, T. C. Edwin, Bertrand M. T. Lin

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programming; due date; NP-hardness; job scheduling; resource constraint

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

On the relocation problem with a second working crew for resource recycling, A survey of single machine scheduling to minimize weighted number of tardy jobs, The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• A fast feasibility test for relocation problems
• Survey of scheduling research involving due date determination decisions
• Generating the best \(K\) sequences in relocation problems
• Optimal two- and three-stage production schedules with setup times included
• Sequencing with Earliness and Tardiness Penalties: A Review
• Relocation problems are hard
• Relocation problems of maximizing new capacities under a common due date
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs