Solving group technology problems via clique partitioning
From MaRDI portal
Publication:877223
DOI10.1007/S10696-006-9011-3zbMATH Open1141.90568OpenAlexW2070630478MaRDI QIDQ877223FDOQ877223
Authors: Haibo Wang, Bahram Alidaee, Fred Glover, Gary A. Kochenberger 
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
Recommendations
- Solving the Generalized Machine Assignment Problem in Group Technology
- A graph partitioning procedure for machine assignment and cell formation in group technology†
- Simulated annealing procedures for forming machine cells in group technology
- A branch-and-branch algorithm for solving the group technology problem
- scientific article; zbMATH DE number 1703853
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A unified modeling and solution framework for combinatorial optimization problems
- Problem Decomposition and Data Reorganization by a Clustering Technique
- A cutting plane algorithm for a clustering problem
- The clique partitioning problem: Facets and patching facets
- Facets of the clique partitioning polytope
- A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
- The partition problem
- Adaptive memory tabu search for binary quadratic programs
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
- Cliques and clustering: A combinatorial approach
- Approximating polynomial functions by feedforward artificial neural networks: Capacity analysis and design
- Methods of Nonlinear 0-1 Programming
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Grouping of parts and components in flexible manufacturing systems
- A close neighbour algorithm for designing cellular manufacturing systems
- A method for finding minimal bottle-neck cells for grouping part-machine families†
- Application of simulated annealing to a linear model forthe formulation of machine cells ingroup technology
- Note on a comparative evaluation of nine well-known algorithms for solving the cell formation problem in group technology
- Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
- Grouping index: a new quantitative criterion for goodness of block-diagonal forms in group 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
Cited In (15)
- Redundant constraints in the standard formulation for the clique partitioning problem
- The unconstrained binary quadratic programming problem: a survey
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- A three-phased local search approach for the clique partitioning problem
- Fixed set search applied to the clique partitioning problem
- Concise integer linear programming formulation for clique partitioning problems
- Iterated maxima search for the maximally diverse grouping problem
- Lagrangian relaxation and pegging test for the clique partitioning problem
- Solving the clique partitioning problem as a maximally diverse grouping problem
- Applications and Computational Advances for Solving the QUBO Model
- A branch-and-branch algorithm for solving the group technology problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- A review on algorithms for maximum clique problems
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
Uses Software
This page was built for publication: Solving group technology problems via clique partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877223)
