An iterative approach for the serial batching problem with parallel machines and job families

DOI10.1007/S10479-013-1339-YMaRDI QIDQ363588zbMATH OpenOpenAlexFDO

Authors Liji Shen, Lars Mönch, Udo Buscher

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

zbMATH Keywords

batchingfamily setupsparallel machinesschedulingVNS

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Scheduling batches on parallel machines with major and minor set-ups
• Serial-batching scheduling problem to minimize total weighted completion time

Cites work

• A polynomial algorithm for a one machine batching problem
• 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
• A survey of scheduling problems with setup times or costs
• An integrated tabu search algorithm for the lot streaming problem in job shops
• Batching in single operation manufacturing systems
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
• Minimizing flow-time on a single machine with integer batch sizes
• On the Complexity of Scheduling with Batch Setup Times
• One-pass batching algorithms for the one-machine problem
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling
• Scheduling with batching: A review
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(10)

• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• 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
• Flow shop batching and scheduling with sequence-dependent setup times
• A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
• Learning-augmented heuristics for scheduling parallel serial-batch processing machines
• Customer order scheduling on a serial-batch machine in precast bridge construction
• Non-identical parallel machines batch processing problem to minimize the makespan: models and algorithms

This page was built for publication: An iterative approach for the serial batching problem with parallel machines and job families

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