Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing

DOI10.1016/j.ejor.2007.02.060zbMath1146.90505OpenAlexW2025744496MaRDI QIDQ2482776

Yahya Fathi, Shona D. Morgan

Publication date: 24 April 2008

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.060

zbMATH Keywords

clusteringcombinatorial optimizationtabu searchheuristic methodselectronics manufacturing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical classification and clustering
• Cluster Analysis: An Application of Lagrangian Relaxation
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• c-means clustering with the l/sub l/ and l/sub infinity / norms
• An Efficient Heuristic Procedure for Partitioning Graphs
• Cluster Analysis and Mathematical Programming

This page was built for publication: Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing