An Exact Approach to the One-Dimensional Facility Layout Problem
From MaRDI portal
Publication:3392227
Recommendations
Cited in
(40)- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- An improved mixed-integer programming model for the double row layout of facilities
- Double-row facility layout with replicate machines and split flows
- A polyhedral approach to the single row facility layout problem
- Strong mixed-integer formulations for the floor layout problem
- On the exact solution of a facility layout problem
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- The one-way layout with ordered parameters: a survey of advances since 1988
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- A new lower bound for the single row facility layout problem
- Novel integer linear programming models for the facility layout problem with fixed-size rectangular departments
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- Provably near-optimal solutions for very large single-row facility layout problems
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Construction heuristics for the single row layout problem with machine-spanning clearances
- Single row facility layout problem using a permutation-based genetic algorithm
- On the unboundedness of facility layout problems
- Optimal solutions for the double row layout problem
- Local branching relaxation heuristics for integer linear programs
- A Facility Coloring Problem in 1-D
- The single row facility layout problem: state of the art
- New exact approaches to row layout problems
- Optimal linear arrangements using betweenness variables
- Decorous combinatorial lower bounds for row layout problems
- Fast local search for single row facility layout
- Single row layout models
- 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
- A GRASP algorithm for solving large-scale single row facility layout problems
- Exact approaches for the combined cell layout problem
- A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation
- A parallel ordering problem in facilities layout
- An efficient genetic algorithm for single row facility layout
- Insertion based Lin-Kernighan heuristic for single row facility layout
- Global approaches for facility layout and VLSI floorplanning
- The corridor allocation problem
- Integer programming for urban design
- A mixed-integer programming formulation for optimizing the double row layout problem
- A computational study and survey of methods for the single-row facility layout problem
This page was built for publication: An Exact Approach to the One-Dimensional Facility Layout Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392227)
