Exact and heuristic procedures for the material handling circular flow path design problem
From MaRDI portal
Publication:852933
Recommendations
- The value of the shortest loop covering all work centers in a manufacturing facility layout
- The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path
- Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
- Facilities layout design optimization with single loop material flow path configuration
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
Cites work
- An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
- Design and operational issues in AGV-served manufacturing systems
- Loop based facility planning and material handling
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving quadratic assignment problems with rectangular distances and integer programming
Cited in
(12)- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
- Sequencing material handling equipment in production facilities
- Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
- An ant colony system for enhanced loop-based aisle-network design
- The value of the shortest loop covering all work centers in a manufacturing facility layout
- Loop based facility planning and material handling
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- Unidirectional circular layout for overhead material handling systems
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Optimal location of dwell points in a single loop AGV system with time restrictions on vehicle availability
This page was built for publication: Exact and heuristic procedures for the material handling circular flow path design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852933)