No abstract

No abstract

No abstract

One of the most practical approaches of improving productivity in a factory is to adopt the superior concept and technique of cellular manufacturing (CM) based on group technology (GT). Particularly, cell formation is an important, critical and difficult step in CM. In general, there have been a number of methodologies proposed for solving a machine-part grouping problem (MPGP). Besides considering the simple cell formation problem, some researchers have focused on machine flexibility, in which parts are having alternative routeings/process plans. However, it is very rare to consider the area of aggregation and disaggregation of machines in cell formation under uncertain constraints and uncertainty. In the light of this, the main aim of this present work is to address the MPGP holistically with the considerations of machine flexibility as well as machine aggregation and disaggregation simultaneously. In addition, based on the availability of alternative routeings, a method is proposed to generate an alternative solution for machine breakdown situations. Thus, the problem nature of this work will be more realistic and practical for today's global manufacturing era. The problem scope has been identified and the model is formulated in mathematical programming form. The objective function of this model is to minimize the total intercellular and intracellular part movement. Since MPGP has been proved to be non-polynomial (NP) complete, a genetic algorithm (GA), which is an excellent optimization technique, is employed to solve this problem.

No abstract