A branch-and-branch algorithm for solving the group technology problem

MaRDI QIDQ922271zbMATH OpenFDO

Authors Andrew Kusiak, Chun Hung Cheng

Publication date 1990

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

bottleneck machinesbranch-and-bound algorithmcomputational resultsgroup technology problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1703853
• Solving the Generalized Machine Assignment Problem in Group Technology
• The multi-dimensional aspects of a group technology algorithm
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
• A combinatorial optimization algorithm for solving the branchwidth problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Solving group technology problems via clique partitioning
• BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM
• An extension of the \(p\)-median group technology algorithm
• A new approach for solving the P-median problem in group technology

Cited in

(5)

• Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing
• Dynamic cellular manufacturing system design considering alternative routing and part operation tradeoff using simulated annealing based genetic algorithm
• Modified Hamiltonian chain: A graph theoretic approach to group technology
• Seriation and matrix reordering methods: An historical overview
• Solving group technology problems via clique partitioning

This page was built for publication: A branch-and-branch algorithm for solving the group technology problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922271)