Split-merge: Using exponential neighborhood search for scheduling a batching machine.
Marta CaboEdgar PossaniChris N. PottsXiang SongPublished in: Comput. Oper. Res. (2015)
Keyphrases
- neighborhood search
- batch processing
- scheduling problem
- flowshop
- scheduling jobs
- simulated annealing
- parallel machines
- single machine
- tabu search
- traveling salesman problem
- variable neighborhood search
- precedence constraints
- release dates
- path relinking
- vehicle routing problem
- processing times
- graph search
- nature inspired
- heuristic methods
- scheduling algorithm
- approximation algorithms
- special case
- knapsack problem
- lower bound
- genetic algorithm