scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A concurrent solution for intra-cell flow path layouts and I/O point locations of cells in a cellular manufacturing system

01 May 2011-Computers & Industrial Engineering (Pergamon)-Vol. 60, Iss: 4, pp 614-634
TL;DR: The proposed layout procedure classifies the flow distance incurred by inter-cell flow into five types and minimizes them with different solution procedures containing various linear programming models and shows that the results obtained may not be as desirable as expected.
About: This article is published in Computers & Industrial Engineering.The article was published on 2011-05-01. It has received 8 citations till now. The article focuses on the topics: Flow network & Minimum-cost flow problem.
Citations
More filters
Journal ArticleDOI
TL;DR: The comparative study of the computational time, number of cells formed and the clustering efficiency obtained, helped to figure out the success rates of each approach and the progress achieved since early 1990s till recent times.

25 citations

Journal ArticleDOI
TL;DR: The present work discusses the cell formation problem, with the objective of minimizing the cumulative cell load variation and cumulative intercellular moves.
Abstract: The efficiency and sustainability of a cellular manufacturing system (CMS) in batch type manufacturing is highly valued. This is done using a systematic method of equipment into machine cells, and components into part families, based on the suitable similar criteria. The present work discusses the cell formation problem, with the objective of minimizing the cumulative cell load variation and cumulative intercellular moves. The quantity of parts, operation sequences, processing time, capacity of machines, and workload of machineries were considered as parameters. For the grouping of equipment, the modified artificial bee colony (MABC) algorithm is considered. The computational procedure of this approach is explained by using up to 40 machines and 100 part types. The result obtained from MABC is compared with the findings acquired from the genetic algorithm (GA) and ant colony system (ACS) in the literature.

10 citations

Proceedings ArticleDOI
01 Dec 2011
TL;DR: In this paper, an algorithm for solving layout design has been proposed that arranges the machines within machine cells, and cells in the shop-floor in such a way that minimizes the total material handling cost.
Abstract: Facility layout design problems are a group of problems that involve the partitioning of a region into work centers or departments to minimize the costs associated with interactions between the work centers and departments. In cellular manufacturing systems, facility layout problem aims to find the most efficient arrangement of facilities within the machine cells and the layout of machine-cells within the workshop. In this paper, an algorithm for solving layout design has been proposed that arranges the machines within machine cells, and cells in the shop-floor in such a way that minimizes the total material handling cost. To validate the developed algorithm, the results obtained by the algorithm are compared to the results of an exhaustive search. Comparison of results shows the validity of the proposed algorithm.

6 citations


Cites methods from "A concurrent solution for intra-cel..."

  • ...They developed a four-phase procedure to solve the model, and illustrated it with an example to show the efficiency of their approach [24]....

    [...]

Journal Article
TL;DR: A facility layout is the arrangement of considerable activities, features, spaces and relationship that exists between them, which generally depends on the products variety and the production volumes.
Abstract: Process optimisation is a major decision problem when drawing a balance between work distribution of workers during processing and maintaining requirement as per demand of customer. Process flow analysis technique is useful tool to optimise the process parameters in process type of industry. A facility layout is the arrangement of considerable activities, features, spaces and relationship that exists between them. The layout design generally depends on the products variety and the production volumes.There are various types of machine layouts, namely fixed product layout, process layout, product layout and cellular layout. In Fixed product layout, the products generally circulate within the production facilities like machines, workers, etc. and product does not move. Process layout groups facilities with similar functions together. Product layout is used for systems with high production volumes and a low variety of products.

4 citations

Journal ArticleDOI
TL;DR: In this paper , exact methods, heuristic approaches, metaheuristic techniques, and artificial intelligence strategies for cellular manufacturing design are reviewed and based on this analysis, some suggestions for future research are proposed.
Abstract: As globalisation and competition grow rapidly, adopting a flexible manufacturing philosophy becomes more critical for manufacturers. Cellular Manufacturing System (CMS) is among one of the most favourable ones which has been deeply studied in academia since this philosophy was coined in 1925. To design the manufacturing system efficiently and effectively, the management team needs to have a comprehensive representation of the definitions, classifications, solution approach to cellular manufacturing design problems. In this study, exact methods, heuristic approaches, metaheuristic techniques, and artificial intelligence strategies for cellular manufacturing design are reviewed. A comparison of solution approaches is discussed and based on this analysis, some suggestions for future research are proposed. Moreover, we tried to highlight the importance of investigating sustainability decisions related to CMS problems, and integration of supply chain decisions with CMS decisions which have not been sufficiently studied to identify a research direction for researchers to model and analyse those issues. Finally, we briefly discuss the placement of CMS as one of the major production systems in the industry 4.0 evolution paradigm. Reviewing the adoption of industry 4.0 techniques by CMS sheds light on the contribution of methodological approaches in transition to intelligent CMS.

3 citations

References
More filters
Book
11 Oct 1991
TL;DR: In this article, the authors propose a planar multifacility location model to solve the problem of plant layout in a single facility and a cyclic network in a multi-modal network.
Abstract: 1. Introduction. 2. The Plant Layout Problem. 3. Computerized Layout Planning. 4. Planar Single Facility Location Problems. 5. Storage Systems Layout. 6. Planar Multifacility Location Problems. 7. Network Location Problems. 8. Cyclic Network Location Problems. 9. Advanced Discrete Location Models. Further reading.

884 citations

Journal ArticleDOI
H.M. Chan1, D.A. Milner1
TL;DR: In this paper, a new algorithm was developed for forming component families and machine groups for cellular manufacture by progressively restructuring the machine component matrix, allowing interaction from the user when exceptions and overlap between groups cause the iterative algorithm to prematurely stop.

547 citations


"A concurrent solution for intra-cel..." refers background in this paper

  • ...…(1996), these algorithms can be classified into the following categories: systematic approach (e.g. Burbidge, 1989), matrix-based approach (e.g. Chan & Milner, 1982), similarity coefficient approach (e.g. Seifoddini & Hsu, 1994), mathematical programming approach (e.g. Rajamani, Singh, &…...

    [...]

Journal ArticleDOI
TL;DR: Two new construction algorithms are presented to solve the machine layout problem in FMS's and the triangle assignment algorithm TAA is found to give solutions of better quality than any other construction method published.
Abstract: This paper analyzes the machine layout problem in flexible manufacturing systems FMS's. We show that the quadratic assignment formulation cannot be used to model the machine layout problem. Four basic types of machine layouts that are frequently encountered in FMS's are presented. A measure to determine the relationship between machines is introduced. Since automated guided vehicles are commonly used to transport material between machines, their motion characteristic is discussed. Two new construction algorithms are presented to solve the machine layout problem in FMS's. They generate solutions with acceptable quality in low computational time. The triangle assignment algorithm TAA is compared to existing methods for 8 test problems and is found to give solutions of better quality than any other construction method published. When compared to existing methods, the computation time performance is attractive.

316 citations


"A concurrent solution for intra-cel..." refers background or methods in this paper

  • ...Heragu and Kusiak (1988) identify four machine layout configurations – circular machine layout, linear single-row machine layout, linear double-row machine layout, and cluster machine layout – in a Flexible Manufacturing System (FMS). They show that the quadratic assignment formulation cannot be used to model the machine layout problem and present two heuristic procedures to solve the machine layout problem. Kouvelis and Kim (1992) study the machine layout problem with a unidirectional loop configuration....

    [...]

  • ...Heragu and Kusiak (1988) identify four machine layout configurations – circular machine layout, linear single-row machine layout, linear double-row machine layout, and cluster machine layout – in a Flexible Manufacturing System (FMS). They show that the quadratic assignment formulation cannot be used to model the machine layout problem and present two heuristic procedures to solve the machine layout problem. Kouvelis and Kim (1992) study the machine layout problem with a unidirectional loop configuration. They propose several heuristic procedures and a branch-and-bound procedure to solve problems of different sizes. Ho, Lee, and Moodie (1993) propose several sequence-pattern matching based methods to design multiple-flow line machine layouts. Ho and Moodie (1998) propose several flow line analysis techniques and Simulated Annealing (SA) to determine the layouts of machines on a linear flow path. Chen, Wang, and Chen (2001) propose a network-based approach that has three stages: building feasible flow network, converting the flow network into a linear flow line, and applying SA to improve the linear flow line....

    [...]

  • ...Heragu and Kusiak (1988) identify four machine layout configurations – circular machine layout, linear single-row machine layout, linear double-row machine layout, and cluster machine layout – in a Flexible Manufacturing System (FMS). They show that the quadratic assignment formulation cannot be used to model the machine layout problem and present two heuristic procedures to solve the machine layout problem. Kouvelis and Kim (1992) study the machine layout problem with a unidirectional loop configuration. They propose several heuristic procedures and a branch-and-bound procedure to solve problems of different sizes. Ho, Lee, and Moodie (1993) propose several sequence-pattern matching based methods to design multiple-flow line machine layouts. Ho and Moodie (1998) propose several flow line analysis techniques and Simulated Annealing (SA) to determine the layouts of machines on a linear flow path....

    [...]

  • ...Heragu and Kusiak (1988) identify four machine layout configurations – circular machine layout, linear single-row machine layout, linear double-row machine layout, and cluster machine layout – in a Flexible Manufacturing System (FMS)....

    [...]

  • ...According to Ho and Moodie (1996), these algorithms can be classified into the following categories: systematic approach (e....

    [...]

Journal ArticleDOI
TL;DR: Both optimal and heuristic procedures are developed for this problem and are based on a dynamic programming formulation, which depends on the ability to solve the static problem efficiently.
Abstract: The problem of plant layout has generally been treated as a static one. In this paper, we deal with the dynamic nature of this problem. Both optimal and heuristic procedures are developed for this problem and are based on a dynamic programming formulation. The use of one of these approaches depends on the ability to solve the static problem efficiently. Finally, we briefly discuss the issue of extending the planning horizon, and how to resolve system nervousness when previously planned layouts need to be changed.

313 citations


"A concurrent solution for intra-cel..." refers background in this paper

  • ...Since the material flow data often changes over time in real systems, researchers (e.g. Lacksonen, 1997; McKendall & Hakobyan, 2010; Montreuil & Laforge, 1992; Montreuil & Venkatadri, 1991; Rosenblatt, 1986) have begun to study the dynamic layout problem....

    [...]

Journal ArticleDOI
TL;DR: Group technology is a method of organization for factories in which organizational units each complete a particular set or “family” of parts with no backflow, or crossflow between groups, and are equipped with all the facilities they need to do so.

310 citations


"A concurrent solution for intra-cel..." refers background in this paper

  • ...According to Ho and Moodie (1996), these algorithms can be classified into the following categories: systematic approach (e.g. Burbidge, 1989), matrix-based approach (e.g. Chan & Milner, 1982), similarity coefficient approach (e.g. Seifoddini & Hsu, 1994), mathematical programming approach (e.g.…...

    [...]