Split-merge: using exponential neighborhood search for scheduling a batching machine
DOI10.1016/J.COR.2015.04.017zbMATH Open1349.90322OpenAlexW326470550MaRDI QIDQ342048FDOQ342048
Authors: Marta Cabo, Edgar Possani, Chris N. Potts, X. Song 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.017
Recommendations
- An exponential neighborhood for a one-machine batching problem
- Exponential size neighborhoods for makespan minimization scheduling
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
- Scheduling a batching machine
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Cites Work
- Scheduling with batching: A review
- Scheduling a batching machine
- A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- A survey of very large-scale neighborhood search techniques
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Multi-start methods for combinatorial optimization
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Exponential neighborhood search for a parallel machine scheduling problem
- An exponential neighborhood for a one-machine batching problem
- An exponential (matching based) neighborhood for the vehicle routing problem
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- Two very large-scale neighborhoods for single machine scheduling
- Solving single batch-processing machine problems using an iterated heuristic
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
- Matching based very large-scale neighborhoods for parallel machine scheduling
- Title not available (Why is that?)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
- Two local search approaches for solving real-life car sequencing problems
Cited In (6)
- Logic-based Benders decomposition for scheduling a batching machine
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- Bi-objective scheduling on a restricted batching machine
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- Just-in-time single-batch-processing machine scheduling
- Column generation for minimizing total completion time in a parallel-batching environment
This page was built for publication: Split-merge: using exponential neighborhood search for scheduling a batching machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342048)
