Solving group technology problems via clique partitioning

DOI10.1007/s10696-006-9011-3zbMath1141.90568OpenAlexW2070630478MaRDI QIDQ877223

Fred Glover, Haibo Wang, Gary A. Kochenberger, Bahram Alidaee

Publication date: 19 April 2007

Published in: International Journal of Flexible Manufacturing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10696-006-9011-3

zbMATH Keywords

Tabu searchMetaheuristicsGroup technologyClique partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Applications and Computational Advances for Solving the QUBO Model, A review on algorithms for maximum clique problems, A three-phased local search approach for the clique partitioning problem, Iterated maxima search for the maximally diverse grouping problem, Concise integer linear programming formulation for clique partitioning problems, Solving the clique partitioning problem as a maximally diverse grouping problem, The unconstrained binary quadratic programming problem: a survey, Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem, Fixed set search applied to the clique partitioning problem, New bounds and constraint propagation techniques for the clique partitioning problem, Lagrangian relaxation and pegging test for the clique partitioning problem, Redundant constraints in the standard formulation for the clique partitioning problem, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

Uses Software

• CPLEX

Cites Work

• Facets of the clique partitioning polytope
• Grouping of parts and components in flexible manufacturing systems
• A cutting plane algorithm for a clustering problem
• Approximating polynomial functions by feedforward artificial neural networks: Capacity analysis and design
• Cliques and clustering: A combinatorial approach
• Note on a comparative evaluation of nine well-known algorithms for solving the cell formation problem in group technology
• A unified modeling and solution framework for combinatorial optimization problems
• Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
• The partition problem
• Adaptive Memory Tabu Search for Binary Quadratic Programs
• A close neighbour algorithm for designing cellular manufacturing systems
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
• Methods of Nonlinear 0-1 Programming
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Grouping index: a new quantitative criterion for goodness of block-diagonal forms in group technology
• Application of simulated annealing to a linear model forthe formulation of machine cells ingroup technology
• A pragmatic approach to machine and part grouping in cellular manufacturing system design
• An application of fuzzy clustering to cellular manufacturing
• Group technology revisited: A simple and robust algorithm with enhanced capability
• Design and scheduling of hybridmulti-cell flexible manufacturing systems
• A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
• The clique partitioning problem: Facets and patching facets
• Problem Decomposition and Data Reorganization by a Clustering Technique