A Hamiltonian path approach to reordering the part-machine matrix for cellular manufacturing

Askin, Ronald G.; Cresswell, Steven H.; Goldberg, Jeffrey B.; Vakharia, Asoo J.

doi:10.1080/00207549108930121

Cited by 116 publications

(47 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, specialised methods were developed, mostly special cases of the general algorithms. The consecutive stage consisted in formulation of mathematical programming tasks, modelling possibly precisely the considered aspects of the problem, see, e.g., papers by Kusiak,Vannelli and Kumar and [12], by Askin et al [13], Veeramani and Mani [14]. Solving of the problems obtained with classical methods of optimisation, though, turned out to be too difficult.…”

Section: The Domain Fundamental Notions and Issuesmentioning

confidence: 99%

Machine-part grouping and cluster analysis: similarities, distances and grouping criteria

Owsiński¹

2009

Bulletin of the Polish Academy of Sciences: Technical Sciences

View full text Add to dashboard Cite

Abstract. The paper considers the machine-part grouping problem, as equivalent to partitioning the set of machines and operations into subsets, corresponding to block diagonalisation with constraints. The attempts to solve the problem with clustering methods are outlined. The difficulties encountered are presented, related to (i) ambiguity of formulations; (ii) selection of criteria; and (iii) lack of effective algorithms. These are illustrated in more detail with a limited survey of similarity and distance definitions, and of criteria used, constituting the main body of the paper. The return is proposed to the basic paradigm of cluster analysis, as providing simple and fast algorithms, which, even if not yielding optimal solutions, can be controlled in a simple manner, and their solutions improved.

show abstract

Section: The Domain Fundamental Notions and Issuesmentioning

confidence: 99%

Machine-part grouping and cluster analysis: similarities, distances and grouping criteria

Owsiński¹

2009

Bulletin of the Polish Academy of Sciences: Technical Sciences

View full text Add to dashboard Cite

show abstract

“…Vannelli and Kumar have shown 14 that the minimal bottle-neck cell is equivalent to minimal cut-node problem and used a heuristic to find minimal bottleneck cells and to determine machines to be duplicated. Askin et al have solved 15 a Hamiltonian path problem to determine machine cells and part families, and Ng has used 16 the minimum spanning tree approach to solve the problem. Oliveira et al have presented 17 a bipartite graph modeling with a graph clustering algorithm for determining machine cells and part families in the CM systems.…”

Section: Introductionmentioning

confidence: 99%

An Ant Colony Optimization Approach for the Machine-Part Cell Formation Problem

Farahani¹,

Hosseini²

2011

IJCIS

View full text Add to dashboard Cite

In this paper, the problem of grouping machines and parts into cells (machine-part cell formation problem) is considered with the objective of minimizing grouping efficacy. An ant colony optimization algorithm is developed to solve such problem. In the proposed algorithm, solutions are constructed in a new manner, two heuristic algorithms are used to determine part families and machine cells and the similarity between parts is used as heuristic information. The proposed algorithm is experimented on 35 test problems from the literature which shows its advantage over existing algorithms. The algorithm improves the best known values of the grouping efficacy for 5 problems.

show abstract

“…Vohra et al (1990) suggested a network based approach to solve the grouping problem and used a modified form of the Gomory-Hu algorithm to decompose the part-machine graph. Askin et al (1991) proposed a Hamiltonian-path algorithm for the grouping problem. David et al (1998) proposed an effective algorithm to identify part-families and bottleneck-parts, given machine groupings.…”

Section: Introductionmentioning

confidence: 99%

Evaluation of Cell Formation Algorithms and Implementation of MOD-SLC Algorithm as An effective Cellular Manufacturing System in a Manufacturing Industry

Satheeshkumar¹

2010

Int.J.of Curr. Engg. and Technol

View full text Add to dashboard Cite

Benefits of cellular manufacturing system depend on major factors namely the design of machine cells and part family, setup time and method of operation. Cellular Manufacturing System (CMS) become a failure when these two factors are not properly employed. This work incorporates five array-based clustering algorithms namely Single linkage clustering method (SLC), Modified-Single Linkage Clustering method (MOD-SLC), Direct Clustering Analysis (DCA), Rank Order Clustering (ROC) and Rank Order Clustering-2 (ROC-2) for analyzing real time manufacturing delay with manufacturing cell formation. In the present study, Modified-Single Linkage Clustering (MOD-SLC) method outperforms

show abstract

A Hamiltonian path approach to reordering the part-machine matrix for cellular manufacturing

Cited by 116 publications

References 18 publications

Machine-part grouping and cluster analysis: similarities, distances and grouping criteria

Machine-part grouping and cluster analysis: similarities, distances and grouping criteria

An Ant Colony Optimization Approach for the Machine-Part Cell Formation Problem

Evaluation of Cell Formation Algorithms and Implementation of MOD-SLC Algorithm as An effective Cellular Manufacturing System in a Manufacturing Industry

Contact Info

Product

Resources

About