One-Dimensional Space Allocation: An Ordering Algorithm
From MaRDI portal
Publication:5572837
DOI10.1287/opre.17.5.812zbMath0182.53304OpenAlexW2132483207MaRDI QIDQ5572837
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.5.812
Related Items (44)
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 ⋮ The double row layout problem ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ 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 ⋮ An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps ⋮ A parallel ordering problem in facilities layout ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ The corridor allocation problem ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Semidefinite relaxations of ordering problems ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Optimization of location of interconnected facilities on parallel lines with forbidden zones ⋮ Optimal solutions for the double row layout problem ⋮ The single row facility layout problem: state of the art ⋮ Methods for the one-dimensional space allocation problem ⋮ An efficient genetic algorithm for single row facility layout ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ An improved mixed-integer programming model for the double row layout of facilities ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ A decomposition-based algorithm for the double row layout problem ⋮ Recent models and techniques for solving the layout problem ⋮ Experimental analysis of simulated annealing based algorithms for the layout problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ Mathematical optimization approach for facility layout on several rows ⋮ Simulated annealing and tabu search approaches for the Corridor Allocation Problem ⋮ Spine layout design ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ On the exact solution of a facility layout problem ⋮ A fast algorithm to generate feasible solution of production facilities layout based on plane segmentation ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ The effect of material flow and workload on the performance of machine location heuristics. ⋮ One-dimensional machine location problems in a multi-product flowline with equidistant locations ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ Exact approaches for the combined cell layout problem ⋮ Efficient models for the facility layout problem
This page was built for publication: One-Dimensional Space Allocation: An Ordering Algorithm
