Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
From MaRDI portal
Publication:1266534
DOI10.1016/0377-2217(95)00349-5zbMath0913.90165OpenAlexW2026188274MaRDI QIDQ1266534
H. A. J. Crauwels, Luk N. Van Wassenhove, Chris N. Potts
Publication date: 29 November 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00349-5
simulated annealingtabu searchsingle machinegenetic algorithmset-up timenumber of late jobsmulti-start descentlocal search heuristics
Related Items (8)
An iterative approach for the serial batching problem with parallel machines and job families ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ Scheduling with batching: A review ⋮ Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine ⋮ An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Simulated annealing: A tool for operational research
- Tabu Search—Part I
- 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
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
