Lot streaming in three-stage production processes

Lot streaming is the process of splitting a given lot or job to allow the overlapping of successive operations in multi-stage production systems, thereby reducing the makespan of the corresponding schedule. This paper develops algorithms to minimize the makespan for a single job in three-stage production processes. At each stage, the job is split into s sublots. For both the flow shop and job shop problems, an algorithm is proposed which computes the minimum makespan in O(log s) time. However, for the open shop, it is shown that to evaluate the minimum makespan requires constant time. Various results are derived which are applicable when the number of stages of production exceeds three.

[1]  Salah E. Elmaghraby,et al.  The machine sequencing problem – review and extensions , 1968 .

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

[3]  William G. Truscott.  Production scheduling with capacity-constrained transportation activities , 1986 .

[4]  F. Robert Jacobs,et al.  REPETITIVE LOTS: FLOW-TIME REDUCTIONS THROUGH SEQUENCING AND DYNAMIC BATCH SIZING , 1988 .

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

[6]  Jaya P. Moily,et al.  Optimal and heuristic procedures for component log-splitting in multi-stage manufacturing systems , 1986 .

[7]  Terence M. Hancock.  Effects of Lot‐splitting under Various Routing Strategies , 1991 .

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

[9]  G. Stalk.  Time-The Next Source of Competitive Advantage , 1988 .

[10]  Dan Triesch,et al.  Polynomial Transfer Lot Sizing Techniques for Batch Processing on Consecutive Machines , 1989 .

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

[12]  C. Monma,et al.  A concise survey of efficiently solvable special cases of the permutation flow-shop problem , 1983 .

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

[14]  Dean H. Kropp,et al.  Optimal and Heuristic Models for Lot Splitting in a Flow Shop , 1990 .

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

[16]  S. Reiter.  A System for Managing Job-Shop Production , 1966 .

[17]  A. Z. Szendrovits.  Note—On the Optimality of Sub-Batch Sizes for a Multi-Stage EPQ Model—A Rejoinder , 1976 .

[18]  Jatinder N. D. Gupta.  M-stage scheduling problem—a critical appraisal , 1971 .

[19]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

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

[21]  Dan Trietsch.  Optimal transfer lots for batch manufacturing: A basic case and extensions , 1987 .

[22]  R. G. Vickson,et al.  Two- and three-machine flow shop scheduling problems with equal sized transfer batches , 1992 .