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.