Flow network design for manufacturing systems layout

DOI10.1016/0377-2217(92)90039-CzbMath0760.90048OpenAlexW1991242764MaRDI QIDQ1197683

Dilip Chhajed, Benoit Montreuil, Timothy J. Lowe

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90039-c

zbMATH Keywords

Lagrangean relaxationheuristiccomponent approachfacilities layout planningflow network designshortest rectilinear flow network

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (max. 100)

Layout design for flexible manufacturing systems considering single-loop directional flow patterns ⋮ Detailed layout planning for irregularly-shaped machines with transportation path design ⋮ Designing an efficient method for tandem AGV network design problem using tabu search ⋮ A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location ⋮ The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path ⋮ Facilities layout design optimization with single loop material flow path configuration ⋮ A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem ⋮ A six sigma based multi-objective optimization for machine grouping control in flexible cellular manufacturing systems with guide-path flexibility ⋮ A practical exact algorithm for the shortest loop design problem in a block layout ⋮ Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm ⋮ Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems ⋮ The value of the shortest loop covering all work centers in a manufacturing facility layout ⋮ Incorporating heterogeneous distance metrics within block layout design ⋮ A dual ascent approach to the fixed-charge capacitated network design problem ⋮ Location of departmental pickup and delivery points for an AGV system

Cites Work

• Unnamed Item
• Unnamed Item
• The facility layout problem
• Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
• Assignment Problems and the Location of Economic Activities
• Multi-Terminal Network Flows
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• P-Complete Approximation Problems
• The complexity of the network design problem
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Hamilton Paths in Grid Graphs

This page was built for publication: Flow network design for manufacturing systems layout