A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem

DOI10.1016/j.cor.2005.05.002zbMath1110.90066OpenAlexW2005162820MaRDI QIDQ850313

Bhaba R. Sarker, Junfang Yu

Publication date: 15 November 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.002

zbMATH Keywords

heuristicdirectional decompositionflowlinemachine-cell location

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Backtracking of jobs in one-dimensional machine location problems
• A heuristic procedure for solving the quadratic assignment problem
• An algorithm for the quadratic assignment problem using Benders' decomposition
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• Solving large quadratic assignment problems in parallel
• The quadratic assignment problem. Theory and algorithms
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem
• Applying an extended guided local search to the quadratic assignment problem
• A hybrid heuristic for the facilities layout problem
• A New Lower Bound for the Quadratic Assignment Problem
• Numerical investigations on quadratic assignment 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
• Locating cells with bottleneck machines in cellular manufacturing systems
• Machine assignment in a nonlinear multi-product flowline

This page was built for publication: A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem