A Minimax Facility Layout Problem Involving Distances Between and Within Facilities
- 1 September 1975
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 7 (4), 345-355
- https://doi.org/10.1080/05695557508975016
Abstract
This paper presents a simple solution procedure for the problem of laying out n facilities, where each facility takes up a planar region of known area but with shape not prespecified, so as to minimize the maximum of the following terms: the greatest of the rectilinear distances between all pairs of regions; the greatest of the rectilinear distances within specified regions. The procedure for finding minimax layouts provides several qualitative insights which suggest design guidelines; virtually closed form answers are obtained.Keywords
This publication has 9 references indexed in Scilit:
- A Minimax Layout Problem on the Line Involving Distances between Classes of ObjectsA I I E Transactions, 1974
- A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear DistancesTransportation Science, 1974
- A Minimax Facility-Configuration Problem Involving Lattice PointsOperations Research, 1973
- A Geometrical Solution Procedure for a Rectilinear Distance Minimax Location Problem1A I I E Transactions, 1972
- A Partitioning Problem with Applications in Regional DesignOperations Research, 1972
- Tree-search algorithms for quadratic assignment problemsNaval Research Logistics Quarterly, 1971
- Sufficient Conditions for Some Optimum-Property Facility DesignsOperations Research, 1967
- A Parking Lot DesignSIAM Review, 1964
- An Introduction to InequalitiesAnneli Lax New Mathematical Library, 1961