An optimal tree search method for the manufacturing systems cell formation problem

DOI10.1016/S0377-2217(97)00078-7zbMath0960.90506MaRDI QIDQ1291773

Konstantinos V. Spiliopoulos, Stella Sofianopoulou

Publication date: 13 May 2001

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

zbMATH Keywords

quadratic programming; flexible manufacturing systems; branch and bound; group technology

Mathematics Subject Classification ID

90B30: Production models

90B80: Discrete location and assignment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On lower bounds for a class of quadratic 0,1 programs
• Grouping of parts and components in flexible manufacturing systems
• Min-cut clustering
• A computational study of graph partitioning
• A projection technique for partitioning the nodes of a graph
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• A New Lower Bound for the Quadratic Assignment Problem
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• An Efficient Heuristic Procedure for Partitioning Graphs
• Application of simulated annealing to a linear model forthe formulation of machine cells ingroup technology
• A comparative study of cell formation in cellular manufacturing systems
• Solving the Generalized Machine Assignment Problem in Group Technology
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem