Abstract
In this article, a novel integrated mixed-integer nonlinear programming model is presented for designing a cellular manufacturing system (CMS) considering machine layout and part scheduling problems simultaneously as interrelated decisions. The integrated CMS model is formulated to incorporate several design features including part due date, material handling time, operation sequence, processing time, an intra-cell layout of unequal-area facilities, and part scheduling. The objective function is to minimize makespan, tardiness penalties, and material handling costs of inter-cell and intra-cell movements. Two numerical examples are solved by the Lingo software to illustrate the results obtained by the incorporated features. In order to assess the effects and importance of integration of machine layout and part scheduling in designing a CMS, two approaches, sequentially and concurrent are investigated and the improvement resulted from a concurrent approach is revealed. Also, due to the NP-hardness of the integrated model, an efficient genetic algorithm is designed. As a consequence, computational results of this study indicate that the best solutions found by GA are better than the solutions found by B&B in much less time for both sequential and concurrent approaches. Moreover, the comparisons between the objective function values (OFVs) obtained by sequential and concurrent approaches demonstrate that the OFV improvement is averagely around 17 % by GA and 14 % by B&B.
Highlights
Nowadays in modern competitive manufacturing environments, each company will be required to be capable of reacting quickly to sudden unpredictable changes in a market
One of the major approaches to enhance both flexibility and efficiency is cellular manufacturing (CM), which is an important application of group technology (GT) that handle the formation of manufacturing cells in a way that each part family is processed using a machine cell
To verify the proposed model and reveal that the concurrent integration of parts scheduling with cell formation (CF) and machines layout is more effective than sequential approach, two small-sized examples are solved by a Branch and Bound (B&B) method under Lingo 8.0 software on an Intel(R) core(TM) i5 CPU 2.6 GHz personal computer with 4.00 GB RAM
Summary
Nowadays in modern competitive manufacturing environments, each company will be required to be capable of reacting quickly to sudden unpredictable changes in a market. Zkki′j, Vj is Binary ∀k, i, k′, j CTMk′j, CTPi, Cmax ≥ 0 ∀k′, j djj′ , αj, βj, xj′, xj′′, y′j, y′j′ ≥ 0 ∀j, j′j = j′ LXc, UXc, LYc, UYc ≥ 0 ∀c
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
