One-Dimensional Space Allocation: An Ordering Algorithm
From MaRDI portal
Cited in
(46)- A decomposition-based algorithm for the double row layout problem
- Exact approaches for the combined cell layout problem
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- An improved mixed-integer programming model for the double row layout of facilities
- Mathematical optimization approach for facility layout on several rows
- Optimization of location of interconnected facilities on parallel lines with forbidden zones
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- The double row layout problem
- Spine layout design
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Fast local search for single row facility layout
- Single row layout models
- Insertion based Lin-Kernighan heuristic for single row facility layout
- A computational study and survey of methods for the single-row facility layout problem
- Semidefinite relaxations of ordering problems
- A polyhedral approach to the single row facility layout problem
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Single row facility layout problem using a permutation-based genetic algorithm
- A matheuristic for solving the single row facility layout problem
- Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem
- A polyhedral study of triplet formulation for single row facility layout problem
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Efficient models for the facility layout problem
- A parallel ordering problem in facilities layout
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- The corridor allocation problem
- A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation
- Methods for the one-dimensional space allocation problem
- A new lower bound for the single row facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Recent models and techniques for solving the layout problem
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- The effect of material flow and workload on the performance of machine location heuristics.
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Global approaches for facility layout and VLSI floorplanning
- An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps
- The single row facility layout problem: state of the art
- A heuristic procedure for the single-row facility layout problem
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- An efficient tabu algorithm for the single row facility layout problem
- Optimal solutions for the double row layout problem
- An efficient genetic algorithm for single row facility layout
- On the exact solution of a facility layout problem
- The constrained single-row facility layout problem with repairing mechanisms
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
This page was built for publication: One-Dimensional Space Allocation: An Ordering Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572837)
