An Exact Approach to the One-Dimensional Facility Layout Problem
From MaRDI portal
Publication:3392227
DOI10.1287/OPRE.1080.0548zbMATH Open1167.90556OpenAlexW1983625635MaRDI QIDQ3392227FDOQ3392227
Authors: André R. S. Amaral 
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1080.0548
Recommendations
Cited In (40)
- Exact approaches for the combined cell layout problem
- Optimal linear arrangements using betweenness variables
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- The one-way layout with ordered parameters: a survey of advances since 1988
- An improved mixed-integer programming model for the double row layout of facilities
- Provably near-optimal solutions for very large single-row facility layout problems
- Simulated annealing and tabu search approaches for the Corridor Allocation Problem
- A GRASP algorithm for solving large-scale single row facility layout problems
- Double-row facility layout with replicate machines and split flows
- Strong mixed-integer formulations for the floor layout problem
- Decorous combinatorial lower bounds for row layout problems
- A Facility Coloring Problem in 1-D
- New exact approaches to row layout problems
- On the unboundedness of facility layout problems
- Integer programming for urban design
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Construction heuristics for the single row layout problem with machine-spanning clearances
- 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
- A polyhedral approach to 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
- Single row facility layout problem using a permutation-based genetic algorithm
- 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
- A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation
- A parallel ordering problem in facilities layout
- The corridor allocation problem
- A new lower bound for the single row facility layout problem
- Local branching relaxation heuristics for integer linear programs
- Global approaches for facility layout and VLSI floorplanning
- The single row facility layout problem: state of the art
- A mixed-integer programming formulation for optimizing the double row layout problem
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- 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
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)
