A tradeoff analysis between process plan selection and cell formation in cellular manufacturing

Kizil, Mevlut; Özbayrak, Mustafa

doi:10.1007/s00170-003-1669-z

Cited by 11 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Goncalves and Resende (2004) explained the procedure for obtaining product-machine groupings when the manufacturing system is represented by a binary product-machine incidence matrix. Kizil and Ozbayrak (2004) proposed a trade off analysis between process plan selection and cell formation in CM. The objective is to generate an algorithm for the process plan selection by considering the trade off between the process plan and the material handling to form a cell.…”

Section: Literature Reviewmentioning

confidence: 99%

Machine cell formation using simulated annealing algorithm in cellular manufacturing system

Adinarayanan¹,

Uthayakumar²,

Prabhakaran³

2018

IJCAET

View full text Add to dashboard Cite

Group technology is a production strategy and it has the ability to get solution for certain problems of complexity and long manufacturing lead times in batch manufacturing. This can be achieved by using a systematic method of equipments into machine cells and components into part families, based on the suitable similarity criteria. The present work deals with the machine cell formation problem with the aim of minimising the aggregate cell load variation and aggregate inter cellular move. The quantity of parts, operation sequences, processing time, capacity of machines, and workload of machineries were considered as parameters. In order to group the machineries, one of the metaheuristic search methodologies the simulated annealing (SA) algorithm is considered. For computational processing 40 machines and 100 part types are being used. From the findings it is observed that, in most of the literature problems SA provides better result than that of other methods in the literature and in few cases it yields equal result to the best one of the other methods.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Machine cell formation using simulated annealing algorithm in cellular manufacturing system

Adinarayanan¹,

Uthayakumar²,

Prabhakaran³

2018

IJCAET

View full text Add to dashboard Cite

show abstract

“…The sample problem that was considered was introduced in [ l 1,25]. A robot was used for intracell material handling as well as interfacing the intracell and intercell handling system.…”

Section: Modeling Environment and Problem Definitionmentioning

confidence: 99%

Evaluation of dispatching rules for cellular manufacturing

Kizil

Özbayrak

Papadopoulou

2006

Int J Adv Manuf Technol

View full text Add to dashboard Cite

In this paper, the effects of various dispatching rules on the operation and performance of cellular manufacturing systems (CMS) are evaluated. When the study of a CMS considers the automated material handling, it is crucial to reduce the gridlock probability (i.e., the probability of an unsuccessful load transfer attempt occurring in the interface point between the intercell and intracell handling system). Preventing an unsuccessful load transfer is critical for the operation of the entire system as a blockage between the automated guided vehicle (AGV) and the overloaded cell results in a total system shutdown. The gridlock probability is influenced by the dispatching rule used to schedule the load transfers in the system. Therefore, in order to reduce this probability it is necessary to use a dispatching rule that will decrease the number of waiting loads in the transfer spurs. The main objective of the paper presented herein is to identify a dispatching rule that maintains the system operational at all times. A group of dispatching rules, including the first come first served (FCFS), shortest imminent operation (SI), longest imminent operation (LI), most remaining operations (MRO), shortest processing time (SPT), shortest remaining process time (SR), and a newly developed rule proposed by the authors, loads with the minimum number of processing first (MNP), are tested and evaluated with respect to whether the capacity of the transfer spurs of the cells is exceeded. This paper presents a simulation model of a cellular manufacturing system, which is used to further explore the effects of the dispatching rules on the system performance. The results show superior performance of the newly proposed MNP rule.

show abstract

“…One area where variants of this problem have received significant consideration is that of designing a cellular manufacturing system. Various authors have addressed the problem either as a sub-problem in the general context of system design (e.g., Nagi et al, 1990;Rajamani et al, 1992;Sankaran and Kasilingam, 1993;Xie, 1993;Ramabhatta and Nagi, 1998;Caux et al, 2000;Uddin and Shanker, 2002;Jayaswal and Adil, 2004;Kizil and Ö zbayrak, 2004;Schaller, 2005) or as a stand-alone problem (i.e., assuming that cell configurations are given) to be solved when major changes occur in the part demands or the product mix (e.g., Singh et al, 1992;Nsakanda, 2004, 2006). Most of the existing approaches proposed in these papers are limited to a single process plan for each part and cannot be readily extended to handle the case of multiple process plans (e.g., Sankaran and Kasilingam, 1993;Xie, 1993;Schaller, 2005).…”

Section: Introductionmentioning

confidence: 99%

“…In most of the works where multiple process plans have been considered, the need to explicitly enumerate all the possible routes for each part makes their solution times prohibitive in solving large‐scale problems (e.g., Nagi et al, 1990; Ramabhatta and Nagi, 1998; Caux et al, 2000; Uddin and Shanker, 2002). For some other works, full advantage cannot be taken of the availability of alternative routing opportunities due to the limitation (in the approaches) of having a single process route per part (e.g., Jayaswal and Adil, 2004; Kizil and Özbayrak, 2004). Rajamani et al (1992) proposed a model that copes with both multiple process plans and multiple process routes.…”

Section: Introductionmentioning

confidence: 99%

Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach

Nsakanda¹,

Diaby²,

Cao³

2010

International Transactions in Operational Research

View full text Add to dashboard Cite

We develop a Dantzig–Wolfe decomposition‐based approach for solving the capacitated part‐routing problem with routing flexibilities, setup times, and setup costs. Large instances of the problem are solved to near‐optimality using the proposed approach. The computational performance of the approach is compared with that of the existing Lagrangean relaxation‐based approach in terms of solution quality and computational times.

show abstract

A tradeoff analysis between process plan selection and cell formation in cellular manufacturing

Cited by 11 publications

References 11 publications

Machine cell formation using simulated annealing algorithm in cellular manufacturing system

Machine cell formation using simulated annealing algorithm in cellular manufacturing system

Evaluation of dispatching rules for cellular manufacturing

Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach

Contact Info

Product

Resources

About