Batch scheduling to minimize maximum lateness
From MaRDI portal
Publication:1373461
DOI10.1016/S0167-6377(97)00028-XzbMath0888.90089OpenAlexW2050859599WikidataQ126742963 ScholiaQ126742963MaRDI QIDQ1373461
Jatinder N. D. Gupta, Jay B. Ghosh
Publication date: 19 November 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00028-x
Related Items
Scheduling two job families on a single machine with two competitive agents ⋮ The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard ⋮ Single machine batch scheduling problem with family setup times and release dates to minimize makespan ⋮ A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ Single machine batch scheduling with non-increasing time slot costs ⋮ MILP models to minimise makespan in additive manufacturing machine scheduling problems ⋮ Scheduling with batching: A review ⋮ Scheduling the production of two-component jobs on a single machine ⋮ Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ A simulated annealing algorithm for single machine scheduling problems with family setups ⋮ Single machine scheduling to minimize the setup time and the earliness ⋮ On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times ⋮ Minimizing maximum lateness with job families
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Scheduling two job classes on a single machine
- Batch scheduling to minimize total completion time
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- On the Complexity of Scheduling with Batch Setup Times
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Scheduling Groups of Jobs on a Single Machine