Splitmerge: Using exponential neighborhood search for scheduling a batching machine
We study the scheduling of a single batching machine with restricted batch size. We develop an exponential neighborhood that can be explored in polynomial time. Dynamic programing formulations are developed for optimal batching. We evaluate and compare different local search heuristics.
exponential neighborhoods batching machine dynamic programming local search maximum lateness