Split-merge: using exponential neighborhood search for scheduling a batching machine
From MaRDI portal
Publication:342048
DOI10.1016/j.cor.2015.04.017zbMath1349.90322OpenAlexW326470550MaRDI QIDQ342048
Edgar Possani, Xiang Song, Chris N. Potts, Marta Cabo
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items
Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system, When serial batch scheduling involves parallel batching decisions: a branch and price scheme, Just-in-time single-batch-processing machine scheduling, Bi-objective scheduling on a restricted batching machine, Column generation for minimizing total completion time in a parallel-batching environment, Logic-based Benders decomposition for scheduling a batching machine
Cites Work
- Unnamed Item
- Matching based very large-scale neighborhoods for parallel machine scheduling
- A survey of very large-scale neighborhood search techniques
- 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
- Scheduling a batching machine
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- Improved dynamic programs for some batching problems involving the maximum lateness criterion
- An exponential neighborhood for a one-machine batching problem
- Scheduling with batching: A review
- Multi-start methods for combinatorial optimization
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- An exponential (matching based) neighborhood for the vehicle routing problem
- Exponential neighborhood search for a parallel machine scheduling 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
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model
- Solving single batch-processing machine problems using an iterated heuristic
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
