A nonlinear optimization approach for solving facility layout problems
From MaRDI portal
Cites work
- A Heuristic Procedure for the Layout of a Large Number of Facilities
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Efficient models for the facility layout problem
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Link-Length Minimization in Networks
- Methods for Modifying Matrix Factorizations
- P-Complete Approximation Problems
- SHAPE: A construction algorithm for area placement evaluation
- Technical Note—Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- The facility layout problem
Cited in
(26)- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- Applying ant system for solving unequal area facility layout problems
- Application of multidimensional scaling techniques to facilities layout
- A -accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Layout designs in cellular manufacturing
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- A convex optimisation framework for the unequal-areas facility layout problem
- An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
- Applying the sequence-pair representation to optimal facility layout designs
- A continuous approach to considering uncertainty in facility design
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- A biased random-key genetic algorithm for the unequal area facility layout problem
- An improved two-stage optimization-based framework for unequal-areas facility layout
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- Facility layout objective functions and robust layouts
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
- Incorporating heterogeneous distance metrics within block layout design
- Layout optimization considering production uncertainty and routing flexibility
- An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
- Using projected cutting planes in the extended cutting plane method
- Strong mixed-integer formulations for the floor layout problem
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
- A new mixed integer programming formulation for facility layout design using flexible bays
This page was built for publication: A nonlinear optimization approach for solving facility layout problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197687)
