Locating cells with bottleneck machines in cellular manufacturing systems

DOI10.1080/00207540110073109zbMath1060.90623OpenAlexW2058344924MaRDI QIDQ4674435

Shaojun Wang, Bhaba R. Sarker

Publication date: 11 May 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540110073109

Mathematics Subject Classification ID

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

Related Items (11)

Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ Single row layout models ⋮ A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem ⋮ A survey for the quadratic assignment problem ⋮ A comprehensive review of flowshop group scheduling literature ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing ⋮ Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing ⋮ Directional decomposition heuristic for a linear machine-cell location problem. ⋮ A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems

Cites Work

• An exact algorithm for the general quadratic assignment problem
• Contributions to the quadratic assignment problem
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• A hybrid heuristic for the facilities layout problem
• The Quadratic Assignment Problem

This page was built for publication: Locating cells with bottleneck machines in cellular manufacturing systems