A one-step tabu search algorithm for manufacturing cell design

DOI10.1057/palgrave.jors.2600704zbMath1054.90539OpenAlexW1994487415MaRDI QIDQ3157354

Sebastián Lozano, Luis Onieva, Belarmino Adenso-Díaz, Ignacio Eguia

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600704

zbMATH Keywords

metaheuristicstabu searchcell designcellular manufacturing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30)

Related Items

Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups ⋮ A hybrid grouping genetic algorithm for the cell formation problem ⋮ APPLYING SIMULATED ANNEALING TO A GENERALIZED CELL FORMATION PROBLEM CONSIDERING ALTERNATIVE ROUTINGS AND MACHINE RELIABILITY ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ Using penalty function and tabu search to solve cell formation problems with fixed cell cost. ⋮ The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research ⋮ An ant colony optimization metaheuristic for machine-part cell formation problems ⋮ A model for the design of dedicated manufacturing cells ⋮ CF-GGA: A grouping genetic algorithm for the cell formation problem ⋮ Modified fuzzy C-means algorithm for cellular manufacturing ⋮ Machine-part cell formation using biclustering

Uses Software

• RELAX4