Batching and scheduling in a multi-machine flow shop

Abstract We study the problem of batching and scheduling n jobs in a flow shop comprising m, m≥2, machines. Each job has to be processed on machines 1,…,m in this order. Batches are formed on each machine. A machine dependent setup time precedes the processing of each batch. Jobs of the same batch are processed on each machine sequentially so that the processing time of a batch is equal to the sum of the processing times of the jobs contained in it. Jobs of the same batch formed on machine l become available for a downstream operation on machine l+1 at the same time when the processing of the last job of the batch on machine l has been finished. The objective is to minimize maximum job completion time. We establish several properties of an optimal schedule and develop polynomial time algorithms for important special cases. They are improvements over the existing methods with regard to their generality and time efficiency.

[1]  Daniel Oron,et al.  A note on flow-shop and job-shop batch scheduling with identical processing-time jobs , 2005, Eur. J. Oper. Res..

[2]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

[3]  Kenneth R. Baker,et al.  Basic Techniques for Lot Streaming , 1993, Oper. Res..

[4]  Zbigniew Nahorski,et al.  One stage systems , 1983 .

[5]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[6]  Michal Tzur,et al.  Lot splitting to minimize average flow-time in a two-machine flow-shop , 2002 .

[7]  Chung-Lun Li,et al.  Lot streaming with supplier–manufacturer coordination , 2004 .

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

[9]  Chris N. Potts,et al.  Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops , 2001, INFORMS J. Comput..

[10]  Subhash C. Sarin,et al.  Evaluation of the potential bene"ts of lot streaming in #ow-shop systems , 2000 .

[11]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[12]  Michael Masin,et al.  Multi-objective lot splitting for a single product m-machine flowshop line , 2004 .

[13]  Huan Neng Chiu,et al.  Cost models for lot streaming in a multistage flow shop , 2005 .

[14]  Faizul Huq,et al.  Employee scheduling and makespan minimization in a flow shop with multi-processor work stations: a case study , 2004 .

[15]  Bertrand M. T. Lin,et al.  Makespan minimization in the two‐machine flowshop batch scheduling problem , 2000 .

[16]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[17]  Daniel Oron,et al.  Flow‐shop batch scheduling with identical processing‐time jobs , 2004 .