An exponential neighborhood for a one-machine batching problem

DOI10.1007/S002910050098MaRDI QIDQ1808727zbMATH OpenOpenAlexFDO

Authors Johann L. Hurink

Publication date 25 November 1999

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002910050098

zbMATH Keywords

batchingexponential neighborhoodslocal search

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• The complexity of one-machine batching problems
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• Exponential neighborhood search for a parallel machine scheduling problem
• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
• A polynomial algorithm for a one machine batching problem

Cited in

(10)

• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• An exponential (matching based) neighborhood for the vehicle routing problem
• Two very large-scale neighborhoods for single machine scheduling
• On the theoretical properties of swap multimoves
• The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• Matching based very large-scale neighborhoods for parallel machine scheduling
• Hybridizations of evolutionary algorithms with large neighborhood search
• A survey of very large-scale neighborhood search techniques

This page was built for publication: An exponential neighborhood for a one-machine batching problem

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