Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
From MaRDI portal
Publication:1610141
DOI10.1016/S0377-2217(98)00196-9zbMath1009.90041OpenAlexW2093964466MaRDI QIDQ1610141
Bertrand M. T. Lin, Cheng, T. C. Edwin
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00196-9
Related Items
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 ⋮ On the relocation problem with a second working crew for resource recycling
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