DISCON: A New Method for the Layout Problem

DOI10.1287/opre.28.6.1375zbMath0447.90025OpenAlexW1993932276MaRDI QIDQ3893625

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)

Related Items (18)

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

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