The value of the shortest loop covering all work centers in a manufacturing facility layout
From MaRDI portal
Publication:5444635
DOI10.1080/00207540600920884zbMath1128.90341OpenAlexW2001747712MaRDI QIDQ5444635
R. A. Ortiz, Ardavan Asef-Vaziri
Publication date: 25 February 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600920884
Related Items (2)
Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout ⋮ Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm
Cites Work
- Loop based facility planning and material handling
- Flow network design for manufacturing systems layout
- Heuristic dispatching models for multi-vehicle materials handling systems
- Network configuration and machine layout in fixed-path material handling systems
- Impact of empty vehicle flow on optimal flow path design for unidirectional AGV systems
- Complexity of the AGV shortest path and single-loop guide path layout problems
- Some Applications of the Generalized Travelling Salesman Problem
- Modelling empty vehicle traffic in AGVS design
- A practical exact algorithm for the shortest loop design problem in a block layout
- An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
This page was built for publication: The value of the shortest loop covering all work centers in a manufacturing facility layout
