DISCON: A New Method for the Layout Problem

DOI10.1287/OPRE.28.6.1375MaRDI QIDQ3893625zbMATH OpenOpenAlexFDO

Authors Zvi Drezner

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.6.1375

zbMATH Keywords

facility locationplaneweighted distanceslayout problemnonconvex mathematical programming problemDISpersionCONcentration

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Cited in

(18)

• A convex optimisation framework for the unequal-areas facility layout problem
• Algorithms for robust single and multiple period layout planning for manufacturing systems
• Application of multidimensional scaling techniques to facilities layout
• Convex maximization formulation of general sphere packing problem
• On the unboundedness of facility layout problems
• An interactive layout heuristic based on hexagonal adjacency graphs
• A knowledge base to assist a heuristic search approach to facility layout
• A model to design recreational boat mooring fields
• Efficient models for the facility layout problem
• Solving circle packing problems by global optimization: numerical results and industrial applications
• The facility layout problem
• Backtracking of jobs in one-dimensional machine location problems
• Single and multiple period layout models for automated manufacturing systems
• Mapping the convergence of genetic algorithms
• Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models
• A distance assignment approach to the facility layout problem
• A multiattribute decision-theoretic approach for the layout design problem
• Layout of facilities with some fixed points

This page was built for publication: DISCON: A New Method for the Layout Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893625)