1997
DOI: 10.1080/002075497194958
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for the cell formation and the machine selection problems in the design of a cellular manufacturing system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2000
2000
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…This partition gives the opportunity to work on each network model separately. Beaulieu et al [7] developed a heuristic algorithm which consists of two main resolution phases. The first phase forms a configuration of independent cells using a cell aggregation procedure.…”
Section: Backgrounds and A Short Literature Surveymentioning
confidence: 99%
“…This partition gives the opportunity to work on each network model separately. Beaulieu et al [7] developed a heuristic algorithm which consists of two main resolution phases. The first phase forms a configuration of independent cells using a cell aggregation procedure.…”
Section: Backgrounds and A Short Literature Surveymentioning
confidence: 99%
“…Delurgio et al [3] presents a Monte Carlo simulation model for designing and selecting integrated circuit (IC) inspection systems and equipment choices. Beaulieu et al [4] consider the cell formation and the machine selection problems for the design of a new cellular manufacturing system using a heuristic algorithm. In addition, the articles for an equipment replacement decisions are presented by Sullivan et al [5] and Oeltjenbruns et al [6].…”
Section: Introductionmentioning
confidence: 99%
“…Extensive research has been devoted to the CF problem with many methods developed on the basis of heuristic clustering techniques to obtain near-optimal or good solutions ( [5], [32], [9], [23]). Due to their reliable performance in solving other combinatorial optimisation problems, metaheuristic algorithms such as simulated annealing [26], genetic algorithms [20] and recently ant colony optimisation [13] provide another class of search methods that have been adopted to efficiently solve the CF problem with very promising results obtained.…”
Section: Introductionmentioning
confidence: 99%