On the One-Dimensional Space Allocation Problem
From MaRDI portal
Publication:3929539
DOI10.1287/opre.29.2.371zbMath0473.90057OpenAlexW1985680559MaRDI QIDQ3929539
Maurice Queyranne, Jean-Claude Picard
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://publications.polymtl.ca/5944/1/EP-R-78-48_Picard.pdf
computational resultsNP-complete problemlayoutlinear ordering problemefficient solution methodsone-dimensional space allocation problemrooted tree case
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ 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 ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Unnamed Item ⋮ A polyhedral study of triplet formulation for single row facility layout problem ⋮ A polyhedral approach to the single row facility layout problem ⋮ Backtracking of jobs in one-dimensional machine location problems ⋮ 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 ⋮ A branch-and-bound algorithm for the single-row equidistant facility 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 ⋮ Polynomial algorithms to finite Veber problem for a tree network ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ 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 ⋮ Recent models and techniques for solving the layout problem ⋮ Exact solution procedures for the balanced unidirectional cyclic layout problem ⋮ Spine layout design ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ Dynamic programming for the quadratic assignment problem on trees ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ On the exact solution of a facility layout problem ⋮ A branch and bound method for solving the bidirectional circular layout problem ⋮ 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 ⋮ Optimal facility layout design ⋮ Exact approaches for the combined cell layout problem ⋮ Efficient models for the facility layout problem
