Lot Streaming in a Two-Stage Flow Shop with Set-up, Processing and Removal Times Separated

A Review of Flowshop Scheduling Research With Setup Times

“…But each machine can only perform one operation at a time, and whenever a machine is shifted from one operation to another, a setup operation is needed. They showed that the makespan minimization problem can be reduced to three subproblems: (i) zero-setup prob- Ham et al (1985) Simple sort C max (GT, Optimal) Baker (1990) Simple sort C max (GT, Optimal) Logendran and Sriskandarajah (1993) Constructive C max (GT) (block, zbfr) Cetinkaya and Kayaligil (1992) Simple sort C max (Unit transfer batch, Optimal) Vickson and Alfredsson (1992) Simple sort C max (unit transfer batch, Optimal) Lee and Mirchandani (1988) Constructive C max (Versatile machines, Approximate) Cheng and Wang (1999a) Dynamic Programming C max (Versatile machines, one setup, Optimal) Ching, Liao, and Wu (1997) Constructive C max (Two part types, bottleneck machine, Approximate) Cheng and Kovalyov (1998) Dynamic Programming C max (Two part types, bottleneck machine, Optimal) Cheng and Wang (1998) Multi-sort C max (one machine batch processor, special caes, Optimal) Cheng, Lin, and Toker (2000) Multi-sort C max (Batch processors special cases, Optimal) Cheng and Wang (1999b) Multi-sort C max (fabrication, assembly special cases, Optimal) Chen, Potts, and Strusevich (1998) Simple sort C max (batch splitting, Approximate) Zdrzalka (1995) Simple sort C max (batch splitting, Approximate) Baker (1995) Simple sort C max (Lot streaming, Optimal) Cetinkaya (1994) Multi-sort C max (Lot streaming, Optimal) Vickson (1995) Multi-sort, ILP C max (Lot streaming, Optimal) Bukchin, Tzur, and Jaffe (1999) Constructive ¥C i (single job heuristic) Li (1997) Constructive C max (multiple machines at stage 2, Approximate) Kim, Kang and Constructive C max (Hybrid flowshop) 3 Steiner (1997, 1998) Computation C max (Lot streaming, single job, Optimal) m Hitomi and Ham (1976) Branch & Bound C max (GT, Optimal) Ham, Hitomi, and Yoshida (1985) Branch & Bound C max (GT, Optimal) Ham, Hitomi, and Yoshida (1985) Multi-sort C max (GT, Approximate) Vakharia and Chang (1990) Simulated Annealing C max (GT, Approximate) Skorin- Kapov and Vakharia (1993) Tabu Search C max (GT, Approximate) Sridhar and Rajendra (1994) Genetic algorithm C max (GT, Approximate) …”

“…The problem with attached setup times was solved by Baker (1995), who uses the theory of flowshops with time-lags. With different batch sizes, Cetinkaya (1994) and Vickson (1995) independently showed that lot streaming for multiple jobs with setup times in a two-machine flowshop decomposes into an easily identifiable sequence of single job problems. Bukchin, Tzur, and Jaffe (1999) developed optimal and heuristic algorithms to find sublot sizes for a single job for minimizing total completion time in a two-machine flowshop.…”

A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

“…For this propose, Vickson and Alfredsson [24] studied the effects of transfer batches in the two-machine and special three-machine problems with unit-size sublots. Cetinkaya [2] proposed an optimal transfer batch and scheduling algorithm for a two-stage flow shop scheduling problem with setup, processing and removal times separated. Vickson [25] examined a two-machine lot-streaming flow shop problem involving setup and sublot transfer times with respect to both continuous and integer valued sublot sizes.…”

Two-machine flow shop scheduling problems with minimal and maximal delays

“…Considering only lower limits α j 's (β j = ∞ for all j ), the problem was shown solvable with an adaptation of Johnson's rule (Mitten 1959;Sule and Huang 1983;Cetinkaya 1993;Dell'Amico 1996). When this interval is such that α j = β j = 0 for every job, we obtain the well known two-machine flowshop scheduling problem with no-wait in process…”