Local search algorithms for the min-max loop layout problem

DOI10.1057/PALGRAVE.JORS.2601269MaRDI QIDQ4656728zbMATH OpenOpenAlexFDO

Authors Julia A. Bennell, Chris N. Potts, J. D. Whitehead

Publication date 14 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601269

zbMATH Keywords

insertion algorithmiterated descentlocal searchloop layouttabu search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Move based heuristics for the unidirectional loop network layout problem
• Configuring layout in unidirectional loop manufacturing systems
• A practical exact algorithm for the shortest loop design problem in a block layout
• Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems
• The facility layout problem

Cited in

(3)

• Move based heuristics for the unidirectional loop network layout problem
• Exact solution procedures for the balanced unidirectional cyclic layout problem
• A relative position-coded differential evolution for loop-based station sequencing problem

This page was built for publication: Local search algorithms for the min-max loop layout problem

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