Transfer Batch Scheduling for a Two-stage Flowshop with Identical Parallel Machine at Each Stage
This paper considers the transfer batch scheduling problem for a two-stage flowshop with identical parallel machines at each stage. Two cases of separable and inseparable setup times and processing times are examined. A scheduling rule similar to Johnson's rule is suggested to minimize makespan. The scheduling method developed in this paper subsumes many existing methods for two-stage flowshop makespan minimization. A numerical example is presented to illustrate the scheduling method.
||Transfer Batch Scheduling for a Two-stage Flowshop with Identical Parallel Machine at Each Stage
Omega (Jan, 1997)
Vol. 25, No. 5
||Lee, Sang M; Kim, J-S.; Kang, S-H.