Solving group technology problems via clique partitioning
From MaRDI portal
Publication:877223
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
Cites work
- A close neighbour algorithm for designing cellular manufacturing systems
- A cutting plane algorithm for a clustering problem
- A method for finding minimal bottle-neck cells for grouping part-machine families†
- A pragmatic approach to machine and part grouping in cellular manufacturing system design
- A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
- A unified modeling and solution framework for combinatorial optimization problems
- Adaptive memory tabu search for binary quadratic programs
- An application of fuzzy clustering to cellular manufacturing
- Application of simulated annealing to a linear model forthe formulation of machine cells ingroup technology
- Approximating polynomial functions by feedforward artificial neural networks: Capacity analysis and design
- Cliques and clustering: A combinatorial approach
- Design and scheduling of hybridmulti-cell flexible manufacturing systems
- Facets of the clique partitioning polytope
- Group technology revisited: A simple and robust algorithm with enhanced capability
- Grouping index: a new quantitative criterion for goodness of block-diagonal forms in group technology
- Grouping of parts and components in flexible manufacturing systems
- Methods of Nonlinear 0-1 Programming
- 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
- Problem Decomposition and Data Reorganization by a Clustering Technique
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- The clique partitioning problem: Facets and patching facets
- The partition problem
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
Cited in
(15)- The unconstrained binary quadratic programming problem: a survey
- A branch-and-branch algorithm for solving the group technology problem
- Lagrangian relaxation and pegging test for the clique partitioning problem
- Fixed set search applied to the clique partitioning problem
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem
- Concise integer linear programming formulation for clique partitioning problems
- Redundant constraints in the standard formulation for the clique partitioning problem
- Solving the clique partitioning problem as a maximally diverse grouping problem
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- A three-phased local search approach for the clique partitioning problem
- Iterated maxima search for the maximally diverse grouping problem
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
- New bounds and constraint propagation techniques for the clique partitioning problem
- Applications and computational advances for solving the QUBO model
- A review on algorithms for maximum clique problems
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)
