Scheduling in cellular manufacturing systems: an heuristic approach

Adopting cellular manufacturing, which enables achieving the goals of just-in-time (JIT) philosophy, has benefited many world-class organizations. Many approaches have been developed for the design of cellular manufacturing systems (CMS). Scheduling of parts and part families in CMS is an important issue. In this study scheduling in flowline-based CMS is addressed by considering varying degrees of missing operations for parts in a cell. A simulated annealing (SA)-based algorithm has been developed for scheduling of parts within a cell for the objective of minimization of weighted sum of makespan, flowtime and idletime. The algorithm makes use of a pool of nine popularly used dispatching rules in scheduling literature. The performance of the proposed algorithm is evaluated using an alternative algorithm with three dispatching rules, and has been proposed and evaluated for minimization of weighted sum of makespan, flowtime and idletime. The proposed algorithm was also evaluated considering two benchmark algorithms, NEH heuristic for minimization of makespan and RC heuristic for minimization of flowtime. From the limited experimental results, it is found that the performance of the proposed algorithm with a larger pool of dispatching rules performs better than the three algorithms tested. Based on the results of the study, it is also found that the operational performance of CMS depends on the percentage of missing operations and scheduling approach (such as dispatching rules) used.

[1]  Peihua Gu,et al.  A multi-constraint neural network for the pragmatic design of cellular manufacturing systems , 1995 .

[2]  Angappa Gunasekaran,et al.  An investigation into the application of group technology in advanced manufacturing systems , 1994 .

[3]  Chandrasekharan Rajendran,et al.  A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs , 2001, Eur. J. Oper. Res..

[4]  Jadranka Skorin-Kapov,et al.  Scheduling a flow-line manufacturing cell: a tabu search approach , 1993 .

[5]  Gregory V. Frazier An evaluation of group scheduling heuristics in a flow-line manufacturing cell , 1996 .

[6]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[7]  S. M. Shafer,et al.  A simulation analyses of factors influencing loading practices in cellular manufacturing , 1995 .

[8]  Jeffrey E. Schaller,et al.  A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell , 2000 .

[9]  C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime , 1993 .

[10]  G. Rand Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[11]  Jatinder N. D. Gupta,et al.  Scheduling a flowline manufacturing cell with sequence dependent family setup times , 2000, Eur. J. Oper. Res..

[12]  Chandrasekharan Rajendran,et al.  Scheduling in a cellular manufacturing system: a simulated annealing approach , 1993 .

[13]  Barbara B. Flynn Repetitive lots: The use of a sequence-dependent set-up time scheduling procedure in group technology and traditional shops , 1987 .

[14]  Nancy Lea Hyer,et al.  Cellular manufacturing in the U.S. industry: a survey of users , 1989 .

[15]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria , 1994 .

[16]  Asoo J. Vakharia,et al.  Job and Family Scheduling of a Flow-Line Manufacturing Cell: A Simulation Study , 1991 .

[17]  C. Rajendran,et al.  An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs , 1997 .

[18]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[19]  Yih-Long Chang,et al.  A simulated annealing approach to scheduling a manufacturing cell , 1990 .

[20]  Rasaratnam Logendran,et al.  Minimizing the makespan of a group scheduling problem: a new heuristic , 1991 .

[21]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

[22]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[23]  Gürsel A. Süer,et al.  Evaluation of manufacturing cell loading rules for independent cells , 1999 .

[24]  N. Anantharaman,et al.  Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems , 2003 .

[25]  Nancy Lea Hyer,et al.  Group technology in the US manufacturing industry: A survey of current practices , 1989 .

[26]  Jack R. Meredith,et al.  A comparison of cellular manufacturing research presumptions with practice , 1999 .

[27]  George R. Wilson,et al.  A hierarchical model for the cell loading problem of cellular manufacturing systems , 1998 .

[28]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[29]  Urban Wemmerlöv,et al.  CELLULAR MANUFACTURING AT 46 USER PLANTS : IMPLEMENTATION EXPERIENCES AND PERFORMANCE IMPROVEMENTS , 1997 .

[30]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..