Job routing and operations scheduling: a network-based virtual cell formation approach

Virtual cellular manufacturing inherits the benefits of traditional cellular manufacturing and maintains the responsiveness to the changing market and routing flexibility of a job shop by integrating machine-grouping, shop layout design and intercellular flow handling. The primary goal of virtual cell formation is to minimize the throughput time of a given job. This paper proposes a method for virtual cell formation by adopting the double-sweep algorithm for the k-shortest path problem, and a heuristic is devised to schedule the virtual cells for the multiple job orders. Results generated from this method include not only the optimal candidates of the virtual cell with the shortest throughput time with sub-optimal alternative route(s) and throughput time(s) as the alternative candidates in case some resources are restricted or are not available. The procedure of virtual cell creation and scheduling is illustrated explicitly with examples. Since most of the scheduling problems are NP-hard and virtual cell scheduling is even more complex due to the bottleneck machines that are demanded by jobs at other cells. For multiplicity of possible virtual cell candidates, in addition to the precedence and resource constraints, heuristic solutions are found to be reasonable.

[1]  Farzad Mahmoodi,et al.  Dynamic Group Scheduling Heuristics in a Flow-through Cell Environment* , 1992 .

[2]  C. L. Ang,et al.  A comparative study of the performance of pure and hybrid group technology manufacturing systems using computer simulation techniques , 1984 .

[3]  B. R. Sarker,et al.  Grouping efficiency measures in cellular manufacturing: A survey and critical review , 1999 .

[4]  Henry C. Co,et al.  Configuring cellular manufacturing systems , 1988 .

[5]  Tom M. Cavalier,et al.  Virtual manufacturing cells: exploiting layout design and intercell flows for the machine sharing problem , 1993 .

[6]  Georges Abdul-Nour,et al.  Physically reconfigurable virtual cells: a dynamic model for a highly dynamic environment , 1995 .

[7]  Philip M. Wolfe,et al.  Application of the Similarity Coefficient Method in Group Technology , 1986 .

[8]  Sunderesh S. Heragu,et al.  Knowledge based approach to machine cell layout , 1989 .

[9]  J. King.  Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm , 1980 .

[10]  Mohsen M. D. Hassan,et al.  Layout design in group technology manufacturing , 1995 .

[11]  Hamid Seifoddini,et al.  Improving the performance of cellular manufacturing by a dynamic part assignment approach , 1996 .

[12]  Vijay R. Kannan,et al.  A Virtual Cellular Manufacturing Approach to Batch Production , 1996 .

[13]  C. L. Moodie,et al.  Cell design strategies for efficient material handling , 1994 .

[14]  F. Robert Jacobs,et al.  Applications and Implementation: AN EXPERIMENTAL COMPARISON OF CELLULAR (GROUP TECHNOLOGY) LAYOUT WITH PROCESS LAYOUT , 1987 .

[15]  Shu-Hsing Chung,et al.  Using the virtual cell concept for short-term production planning for flexible job shop manufacturing systems , 1993 .

[16]  B. Sarker,et al.  A comparison of existing grouping efficiency measures and a new weighted grouping efficiency measure , 2001 .

[17]  Farzad Mahmoodi,et al.  A comprehensive analysis of group scheduling heuristics in a job shop cell , 1993 .

[18]  Bhaba R. Sarker,et al.  Measures of grouping efficiency in cellular manufacturing systems , 2001, Eur. J. Oper. Res..

[19]  Rakesh Nagi,et al.  Multiple routeings and capacity considerations in group technology applications , 1990 .

[20]  Charles R. McLean,et al.  THE VIRTUAL MANUFACTURING CELL , 1982 .