Flow shop lot streaming

Lot streaming is a process of breaking a batch of jobs into smaller lots, and then processing these in an overlapping fashion on the machines. This important concept can significantly improve the overall performance of a production process, and thereby make the operation of a manufacturing system lean. Flow Shop Lot Streaming introduces the reader to this significant production process, presents various analysis techniques, and allows the reader to quickly become conversant with the state-of-the-art techniques necessary to embark on new research directions. This text begins with an introduction to and a brief historical perspective of the lot streaming problem, and continues with generic mathematical models for this problem. Flow Shop Lot Streaming presents systematic analysis, algorithms, key ideas and illustrative examples using 2-machine, 3-machine, and the general m-machine flow shop lot streaming problems.

Flow Shop Lot Streaming will appeal to production and operations management engineers, researchers, and academics interested in implementing the latest models, analysis, and algorithms in the study of manufacturing systems.

Preface	p. vii
1 Introduction to the Lot Streaming Problem	p. 1
1.1 Introduction	p. 1
1.2 Terminology	p. 2
1.2.1 Consistent and Variable Sublots	p. 2
1.2.2 Equal Sublots	p. 2
1.2.3 Continuous and Discrete Sublot Sizes	p. 4
1.2.4 Critical Sublot	p. 4
1.2.5 Lot-Attached and Lot-Detached Setups	p. 4
1.2.6 Run-In and Run-Out Times for a Lot j	p. 5
1.2.7 Run-In and Run-Out Times for a Sequence of Lots	p. 5
1.2.8 Start and Stop Lags	p. 6
1.2.9 Transfer Lag	p. 6
1.2.10 No Idling	p. 7
1.2.11 Intermittent Idling	p. 7
1.2.12 No-Wait Flow Shop	p. 7
1.3 Assumptions, Notation, and Classification Scheme	p. 7
1.3.1 Assumptions	p. 7
1.3.2 Notation	p. 8
1.3.3 Classification Scheme	p. 8
1.4 Dominance in Lot Streaming Models	p. 9
1.5 Potential Benefits of Lot Streaming	p. 9
1.5.1 m/1/E/II/CV/{{C max , MFT, }}	p. 10
1.5.1.1 Makespan (C max )	p. 10
1.5.1.2 Mean Flow Time (MFT)	p. 11
1.5.1.3 Average WIP Level ( )	p. 13
1.5.2 m/N/E/II/CV/{{C max , MFT, }}	p. 15
1.5.2.1 Makespan (C max )	p. 15
1.5.2.2 Mean Flow Time (MFT)	p. 17
1.5.2.3 Average WIP Level ( )	p. 18
1.6 A Brief Historical Perspective	p. 20
1.6.1 Evolution of Lot Streaming	p. 20
1.6.2 Research in Lot Streaming	p. 22
1.6.2.1 Two-Machine Lot Streaming Problems	p. 22
1.6.2.2 Three-Machine Lot Streaming Problems	p. 24
1.6.2.3 m-Machine Lot Streaming Problems	p. 26
1.7 Applications of Lot Streaming	p. 30
1.8 Chapter Summary	p. 31
2 Generic Mathematical Models for the Flow Shop Lot Streaming Problem	p. 33
2.1 Introduction	p. 33
2.2 Some Generic Mathematical Models for the Flow Shop Lot Streaming Problem	p. 33
2.2.1 Notation	p. 33
2.2.2 m/N/{{C,E,V}}/{{II,NI}}/{{CV,DV}}/{{Lot-Attached Setup and Removal Times, Sublot Transfer Times, No Intermingling}}	p. 35
2.2.3 m/N/{{C,E,V}}/{{II,NI}}/{{CV,DV}}/{{Lot-Detached Setup and Removal Times, Sublot Transfer Times, No Intermingling}}	p. 40
2.2.4 m/N/{{C,E,V}}/{{II,NI}}/{{CV,DV}}/{{Sublot-Attached Setup and Removal Times, Sublot Transfer Times, Intermingling}}	p. 42
2.2.5 m/N/{{C,E,V}}/{{II,NI}}/{{CV,DV}}/{{Sublot-Detached Setup and Sublot-Attached Removal Times, Sublot Transfer Times, Intermingling}}	p. 45
2.2.6 The Case of Variable Sublots	p. 47
2.3 Mathematical Models for Special Cases	p. 50
2.3.1 2/1/C/{{II,NI}}/{{CV,DV}}/{{Lot-Detached Setup, No-Wait}}	p. 50
2.3.2 2/N/C/{{II,NI}}/{{CV,DV}}/{{Lot-Attached/Detached Setup, Sublot Transfer Times}}	p. 53
2.3.3 2/1/C/II/CV/	p. 55
2.3.4 2/1/C/II/CV/ , Sublot-Attached Setup	p. 56
2.3.5 3/1/C/ {{NI,II}}/(CV,DV}}/{{No Setup}}	p. 57
2.3.6 m/1/C/II/CV/	p. 57
2.3.7 m/1/E/II/CV/Sublot-Attached Setup, Transfer Times/Unified Cost Function	p. 59
2.4 Chapter Summary	p. 59
3 Two-Machine Lot Streaming Models	p. 61
3.1 A Brief Overview	p. 61
3.2 2/1/C/{{NI,II}}/CV	p. 63
3.3 2/1/C/{{NI,II}}/DV	p. 71
3.3.1 Sublot Sizing Algorithm for 2/1/C/{{NI,II}}/DV	p. 79
3.4 2/1/C/II/CV/{{Lot-Detached Setup Times, No-Wait}}	p. 81
3.5 2/1/C/II/DV/{{Lot-Detached Setup Times, No-Wait}}	p. 84
3.5.1 A Heu(ristic )olution Procedure for Unequal Integer Sublot Sizes ( )	p. 85

Available:*

On Order

Summary

Summary

Table of Contents