Lot streaming and scheduling multiple products in two-machine no-wait flowshops

We consider the problem of minimizing makespan in two-machine no-wait flowshops with multiple products requiring lot streaming. A “product” (or lot) consists of many identical items. Lot streaming (lot sizing) is the process of creating sublots (or transfer batches to move the completed portion of a production )sublot to downstream machines so that operations can be overlapped. The number of sublots for each product is fixed. When the flowshop produces only a single product, we obtain optimal continuous-sized sublots. It is shown that these sublot sizes are also optimal for the problem of simultaneous lot streaming and scheduling of multiple products. The optimal scheduling of products can be accomplished by application of the algorithm due to Gilmore and Gomory [1]. Then, we devise an efficient heuristic for the problem of simultaneous lot streaming (finding optimal integer-sized sublots) and scheduling of multiple products. Computational results indicate that this heuristic can consistently deliver clos...

[1]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[2]  A. Z. Szendrovits.  Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model , 1975 .

[3]  S. Goyal.  Note—Note on “Manufacturing Cycle Time Determination for a Multi-Stage Economic Production Quantity Model” , 1976 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[6]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[7]  William G. Truscott,et al.  Scheduling production activities in multi-stage batch manufacturing systems , 1985 .

[8]  Chris N. Potts,et al.  Flow shop scheduling with lot streaming , 1989 .

[9]  David F. Pyke,et al.  Solution Procedures for the Lot‐Streaming Problem , 1990 .

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

[11]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[12]  Kenneth R. Baker,et al.  A comparative study of lot streaming procedures , 1993 .

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

[14]  G. Steiner,et al.  BATCH SCHEDULING TO MINIMIZE CYCLE TIME, FLOW TIME, AND PROCESSING COST , 1993 .

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

[16]  Chris N. Potts,et al.  Lot streaming in three-stage production processes , 1994 .

[17]  R. Vickson.  Optimal lot streaming for multiple products in a two-machine flow shop , 1995 .

[18]  Kenneth R. Baker,et al.  Lot streaming in the two-machine flow shop with setup times , 1995, Ann. Oper. Res..

[19]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[20]  Stéphane Dauzère-Pérès,et al.  Lot Streaming in Job-Shop Scheduling , 1997, Oper. Res..