Algorithms for robust single and multiple period layout planning for manufacturing systems

DOI10.1016/0377-2217(92)90032-5zbMath0825.90472OpenAlexW1973862684MaRDI QIDQ1205706

Genaro J. Gutiérrez, Panagiotis Kouvelis, Abbas A. Kurawarwala

Publication date: 1 April 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)90032-5

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (27)

Facility layout problem with QAP formulation under scenario-based uncertainty ⋮ Robust calibration of numerical models based on relative regret ⋮ Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Multi-period planning and uncertainty issues in cellular manufacturing: a review and future directions ⋮ A robustness approach to international sourcing ⋮ Investment evaluation based on the commerical scope. The production of natural gas ⋮ The min-p robust optimization approach for facility location problem under uncertainty ⋮ Design of a facility layout problem in cellular manufacturing systems with stochastic demands ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria ⋮ Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem ⋮ Supply chain network design under uncertainty: a comprehensive review and future research directions ⋮ Robust optimization of fourth party logistics network design under disruptions ⋮ An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem ⋮ A new model for robust facility layout problem ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Reconfigurable layout problem ⋮ Layout optimization considering production uncertainty and routing flexibility ⋮ Robust balancing of mixed model assembly line ⋮ Mitigation of risk in facility layout design for single and multi-period problems ⋮ Design of a reliable logistics network with hub disruption under uncertainty ⋮ A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty ⋮ A robustness approach to uncapacitated network design problems ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ Flexible machine layout design for dynamic and uncertain production environments ⋮ A heuristic to minimax absolute regret for linear programs with interval objective function coefficients

Cites Work

• Unnamed Item
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Single and multiple period layout models for automated manufacturing systems
• The Quadratic Assignment Problem
• A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
• The Dynamics of Plant Layout
• A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
• DISCON: A New Method for the Layout Problem
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: Algorithms for robust single and multiple period layout planning for manufacturing systems