An exponential neighborhood for a one-machine batching problem

DOI10.1007/s002910050098zbMath0940.90039OpenAlexW2163705084MaRDI QIDQ1808727

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

local searchbatchingexponential neighborhoods

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (9)

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

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