An iterative approach for the serial batching problem with parallel machines and job families
From MaRDI portal
Publication:363588
DOI10.1007/s10479-013-1339-yzbMath1271.90037OpenAlexW2056941963MaRDI QIDQ363588
Lars Mönch, Udo Buscher, Liji Shen
Publication date: 3 September 2013
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1339-y
Related Items (7)
Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types ⋮ A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Flow shop batching and scheduling with sequence-dependent setup times ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
Cites Work
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- A simulated annealing algorithm for single machine scheduling problems with family setups
- An integrated tabu search algorithm for the lot streaming problem in job shops
- Batching in single operation manufacturing systems
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- Variable neighborhood search
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- Scheduling with batching: A review
- A survey of scheduling problems with setup times or costs
- Minimizing flow-time on a single machine with integer batch sizes
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the Complexity of Scheduling with Batch Setup Times
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Scheduling
- Variable neighborhood search: Principles and applications
This page was built for publication: An iterative approach for the serial batching problem with parallel machines and job families
