The Single Period Stochastic Plant Layout Problem
Authors:
- 1 May 1992
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 24 (2) , 169-176
Abstract
In this paper we present an optimal solution procedure for the single period stochastic plant layout problem. The procedure only requires solving a “deterministic” from-to flow matrix. This “deterministic” matrix is a weighted-average of all from-to flow matrices. Since it may be difficult to estimate the probabilities of occurrence of the various states of nature, we developed a simulation model to test the robustness of our approach. For over 26,000 problems examined, the average error of using our approach was very small, only about one-sixth of one percent.Keywords
This publication has 13 references indexed in Scilit:
- A Layout Planning System with Multiple Criteria and a Variable Domain RepresentationManagement Science, 1987
- A Heuristic Procedure for the Layout of a Large Number of FacilitiesManagement Science, 1987
- DISCON: A New Method for the Layout ProblemOperations Research, 1980
- The facilities layout problem: a multi-goal approachInternational Journal of Production Research, 1979
- An n‐step, 2‐variable search algorithm for the component placement problemNaval Research Logistics Quarterly, 1973
- Quadratic Assignment Problem Algorithms and the Location of Indivisible FacilitiesManagement Science, 1966
- The Optimal Assignment of Facilities to Locations by Branch and BoundOperations Research, 1966
- The Quadratic Assignment ProblemManagement Science, 1963
- A Heuristic Algorithm and Simulation Approach to Relative Location of FacilitiesManagement Science, 1963
- Optimal and Suboptimal Algorithms for the Quadratic Assignment ProblemJournal of the Society for Industrial and Applied Mathematics, 1962