Directional decomposition heuristic for a linear machine-cell location problem.

DOI10.1016/S0377-2217(02)00440-XzbMATH Open1036.90048OpenAlexW2045752614MaRDI QIDQ1811151FDOQ1811151

Authors: Junfang Yu, Bhaba R. Sarker 

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

Recommendations

• A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
• A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
• Locating cells with bottleneck machines in cellular manufacturing systems
• Joint determination of machine cells and linear intercell layout
• One-dimensional machine location problems in a multi-product flowline with equidistant locations

zbMATH Keywords

HeuristicDirectional decompositionFlowlineMachine-cell location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Decomposition methods (49M27) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Locating cells with bottleneck machines in cellular manufacturing systems
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• Numerical investigations on quadratic assignment problems
• Formation of machine cells and part families: A modified p-median model and a comparative study
• A sequence-based materials flow procedure for designing manufacturing cells
• A two-phase procedure for duplicating bottleneck machines in a linear layout, cellular manufacturing system
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• Reducing work-in-process movement for multiple products in one-dimensional layout problems
• An n‐step, 2‐variable search algorithm for the component placement problem
• Backtracking and its Amoebic Properties in One-dimensional Machine Location Problems

Cited In (12)

• Decorous combinatorial lower bounds for row layout problems
• A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
• Global optimality conditions and optimization methods for quadratic assignment problems
• Locating cells with bottleneck machines in cellular manufacturing systems
• Machine assignment in a nonlinear multi-product flowline
• Joint determination of machine cells and linear intercell layout
• A survey for the quadratic assignment problem
• Single row layout models
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• Fast simulated annealing for single-row equidistant facility layout
• A heuristic method to solve the location and machine selection problem in a two-dimensional continuous area
• A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems

This page was built for publication: Directional decomposition heuristic for a linear machine-cell location problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811151)