Provably near-optimal solutions for very large single-row facility layout problems
From MaRDI portal
Publication:3396400
DOI10.1080/10556780902917735zbMath1180.90258OpenAlexW2110069759MaRDI QIDQ3396400
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780902917735
global optimizationcombinatorial optimizationsemidefinite optimizationsingle-row facility layoutspace allocation
Related Items (27)
Strong mixed-integer formulations for the floor layout problem ⋮ 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 ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ Single row layout models ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ A parallel ordering problem in facilities layout ⋮ 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 ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ Optimal solutions for the double row layout problem ⋮ The single row facility layout problem: state of the art ⋮ An efficient genetic algorithm for single row facility layout ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem ⋮ Global optimization ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ New exact approaches to row layout problems ⋮ Exact approaches for the combined cell layout problem
Uses Software
This page was built for publication: Provably near-optimal solutions for very large single-row facility layout problems
