Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs

DOI10.1016/0377-2217(95)00349-5MaRDI QIDQ1266534zbMATH OpenOpenAlexFDO

Authors H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove

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

zbMATH Keywords

genetic algorithmlocal search heuristicsmulti-start descentnumber of late jobsset-up timesimulated annealingsingle machinetabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
• Single machine scheduling with batch set-up times to minimize maximum lateness
• scientific article; zbMATH DE number 1416517

Cites work

• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• scientific article; zbMATH DE number 151868 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• On the Complexity of Scheduling with Batch Setup Times
• Optimization by simulated annealing
• Simulated annealing: A tool for operational research
• Tabu Search—Part I

Cited in

(10)

• An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• 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
• Scheduling with batching: A review
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
• scientific article; zbMATH DE number 5149339 (Why is no real title available?)
• 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
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems

This page was built for publication: Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266534)