A heuristic to minimize makespan of cell scheduling problem

Abstract Scheduling problem in a cellular manufacturing environment is treated as group scheduling problem, which assumes that all parts in a part family are processed in the same cell and no inter-cellular transfer is needed. In a typical CMS environment, however, there could be some exceptional parts, which need to visit machines in the other cells. This fact limits the applicability of group scheduling approaches. This paper addresses the scheduling of manufacturing cells in which parts may need to visit different cells. A two-stage heuristic named as SVS-algorithm is proposed to solve this problem. These stages are termed as intra-cell scheduling and inter-cell scheduling. Through intra-cell scheduling, the sequence of parts within manufacturing cells is determined. In inter-cell scheduling however, the sequence of cells is obtained. The performance of proposed SVS-algorithm is evaluated on 15 problems selected from literature. The results reveal that the SVS-algorithm performs better than LN–PT method in all the selected problems with respect to average makespan.

[1]  P. Vrat,et al.  Some design issues in cellular manufacturing using the fuzzy programming approach , 1999 .

[2]  Jan Riezebos,et al.  Production planning and control systems for cellular manufacturing , 1998 .

[3]  Ching-Jong Liao,et al.  Group scheduling on two cells with intercell movement , 1996, Comput. Oper. Res..

[4]  Anthony Vannelli,et al.  Strategic subcontracting for efficient disaggregated manufacturing , 1986 .

[5]  Shahrukh A. Irani,et al.  An approach to the design of a manufacturing cell under economic considerations , 2002 .

[6]  P. Waghodekar,et al.  Machine-component cell formation in group technology: MACE , 1984 .

[7]  Farzad Mahmoodi,et al.  Group scheduling and order releasing: Review and foundations for research , 1992 .

[8]  Warren R. DeVries,et al.  Group technology production methods in manufacture , 1991 .

[9]  C. Sriskandarajah,et al.  Two-machine group scheduling problem with blocking and anticipatory setups , 1993 .

[10]  Rasaratnam Logendran,et al.  Combined heuristics for bi-level group scheduling problems , 1995 .

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

[12]  J. M. Kay,et al.  Group technology and cellular manufacturing: state-of-the-art synthesis of research and practice , 1998 .

[13]  J. King,et al.  Machine-component group formation in group technology: review and extension , 1982 .

[14]  K. R Baker,et al.  Scheduling groups of jobs in the two-machine flow shop , 1990 .

[15]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[16]  Allan S. Carrie,et al.  Numerical taxonomy applied to group technology and plant layout , 1973 .

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

[18]  Jeffrey E. Schaller.  A new lower bound for the flow shop group scheduling problem , 2001 .

[19]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[20]  J. King,et al.  Machine-component group formation in group technology , 1980 .

[21]  Hamid Seifoddini,et al.  A note on the similarity coefficient method and the problem of improper machine assignment in group technology applications , 1989 .

[22]  Prem Vrat,et al.  Post design modeling for cellular manufacturing system with cost uncertainty , 1998 .

[23]  A. Kusiak,et al.  Efficient solving of the group technology problem , 1987 .

[24]  A. E. King.  A Comprehensive Review of Production-oriented Manufacturing Cell Formation Techniques , 1996 .

[25]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[26]  Hamid Seifoddini,et al.  Single linkage versus average linkage clustering in machine cells formation applications , 1989 .

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

[28]  T. Narendran,et al.  An assignment model for the part-families problem in group technology , 1990 .

[29]  Massoud Bazargan-Lari,et al.  Layout designs in cellular manufacturing , 1999, Eur. J. Oper. Res..

[30]  Maw-Sheng Chern,et al.  Two-machine flowshop group scheduling problem , 2000, Computers & Operations Research.

[31]  M. Chandrasekharan,et al.  GROUPABIL1TY: an analysis of the properties of binary data matrices for group technology , 1989 .

[32]  Farzad Mahmoodi,et al.  A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell , 1991 .

[33]  Yasuki Sekiguchi,et al.  OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS , 1983 .

[34]  Jean-Marie Proth,et al.  Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets , 1995 .

[35]  Rakesh Nagi,et al.  An efficient heuristic in manufacturing cell formation for group technology applications , 1990 .

[36]  Kripa Shanker,et al.  Grouping of parts and machines in presence of alternative process routes by genetic algorithm , 2002 .

[37]  Katsundo Hitomi,et al.  Optimal Two-Stage Production Scheduling with Setup Times Separated , 1979 .

[38]  Festus O. Olorunniwo,et al.  The impact of management and employees on cellular manufacturing implementation , 2002 .

[39]  M Soleymanpour,et al.  A transiently chaotic neural network approach to the design of cellular manufacturing , 2002 .

[40]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

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