A Minimax Planar Facility Layout Problem.
FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
Pagination or Media Count:
The paper considers the problem of laying out N planar facilities where N is at least 2, or departments, of known areas but with shapes not prespecified, so that the maximum rectilinear distance between facilities is minimized. A solution procedure is derived which explicitly specifies a minimax layout, which will have one of two known shapes, and has the property that either the facility with largest area or the two facilities with largest areas are not enclosed by the facilities. Closed form answers to the minimax layout problem are obtained for some special cases. Author
- Operations Research