Directional decomposition heuristic for a linear machine-cell location problem.
From MaRDI portal
Publication:1811151
DOI10.1016/S0377-2217(02)00440-XzbMath1036.90048OpenAlexW2045752614MaRDI QIDQ1811151
Publication date: 10 June 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00440-x
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Decomposition methods (49M27)
Related Items (7)
Single row layout models ⋮ A survey for the quadratic assignment problem ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Decorous combinatorial lower bounds for row layout problems ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Global optimality conditions and optimization methods for quadratic assignment problems ⋮ A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
Cites Work
- Unnamed Item
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Numerical investigations on quadratic assignment problems
- Formation of machine cells and part families: A modified p-median model and a comparative study
- Backtracking and its Amoebic Properties in One-dimensional Machine Location Problems
- Reducing work-in-process movement for multiple products in one-dimensional layout problems
- A two-phase procedure for duplicating bottleneck machines in a linear layout, cellular manufacturing system
- A sequence-based materials flow procedure for designing manufacturing cells
- An n‐step, 2‐variable search algorithm for the component placement problem
- Locating cells with bottleneck machines in cellular manufacturing systems
This page was built for publication: Directional decomposition heuristic for a linear machine-cell location problem.
