Abstract
Abstract This paper considers two related problems involving the design of rectangular layouts of m activities. In each of the problems, costs are incurred which are nondecreasing in distance between activities. The distance between two activities is either the worst-case rectilinear distance, or the worst-case Tchebyshev distance. Minisum and minimax layout problems are then considered and solution techniques are provided. The solution techniques demonstrate that both the area (e.g., number of square feet) taken up by the facilities, as well as the relative use of the facilities, must be considered in order to solve the layout problems of interest.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
