The value of the shortest loop covering all work centers in a manufacturing facility layout

DOI10.1080/00207540600920884MaRDI QIDQ5444635zbMATH OpenOpenAlexFDO

Authors Ardavan Asef-Vaziri, R. A. Ortiz

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

zbMATH Keywords

generalized traveling salesman problemfacility planningAGVmaterials handling

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
• Exact and heuristic procedures for the material handling circular flow path design problem
• Configuring layout in unidirectional loop manufacturing systems
• The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path
• Flow network design for manufacturing systems layout

Cites work

• 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
• Complexity of the AGV shortest path and single-loop guide path layout problems
• Flow network design for manufacturing systems layout
• Heuristic dispatching models for multi-vehicle materials handling systems
• Impact of empty vehicle flow on optimal flow path design for unidirectional AGV systems
• Loop based facility planning and material handling
• Modelling empty vehicle traffic in AGVS design
• Network configuration and machine layout in fixed-path material handling systems
• Some Applications of the Generalized Travelling Salesman Problem

Cited in

(7)

• A practical exact algorithm for the shortest loop design problem in a block layout
• Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
• Exact and heuristic procedures for the material handling circular flow path design problem
• Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
• Loop based facility planning and material handling
• Unidirectional circular layout for overhead material handling systems
• Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm

This page was built for publication: The value of the shortest loop covering all work centers in a manufacturing facility layout

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