manufacturing systems so that operations of a given lot can be overlapped. This technique can
reduce manufacturing makespan and is an effective tool for time-based manufacturing strategy.
Several research articles appeared in literature to solve this problem and most of these studies
are limited to pure flowshop environments where there is only a single machine in each stage.
On the other hand, because of the applicability of hybrid flowshops in different manufacturing
settings, the scheduling of these types of shops is also extensively studied by several authors.
However, the issue of lot streaming in hybrid flowshop environment is not well studied. In this
paper, we aim to initiate research in bridging the gap between the research efforts in flowshop
lot streaming and hybrid flowshop scheduling. We present a comprehensive mathematical
model for scheduling flexible hybrid flowshop with lot streaming. Numerical example
demonstrated that lot streaming can result in larger makespan reduction in hybrid flowshop
where there is a limited research than in pure flowshop where research is abundant.
How to cite this paper
Defersha, F. (2011). A comprehensive mathematical model for hybrid flexible flowshop lot streaming problem.International Journal of Industrial Engineering Computations , 2(2), 283-294.
Refrences
Baker, K. (1995). Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research, 57, 1–11.
Baker, K. R. & Jia, D., (1993). A comparative study of lot streaming procedures. OMEGA International Journal of Management Sciences, 21, 561–566.
Bertel, S. & Billaut, J. C. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research, 159, 651–662.
Biskup, D. & Feldmann, M. (2006). Lot streaming with varaibal sublots: an integer programming formulation. Journal of Operational Research Society, 57, 296–303.
Blackburn, J. (1991). Time-Based Competition. Business One Irwin, Burr Ridge, IL,
Bockerstette, J. & Shell, R. (1993). Time Based Manufacturing. McGraw-Hill, New York,
Botta-Genoulaz, V. (2000). Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics, 64, 101–111.
Bukchin, J. & Masin, M. (2004). Multi-objective lot splitting for a single product m-machine flowshop line. IIE Transactions, 36, 191–202.
Chang, J. H. & Chiu, H. N. (2005). A comprehensive review of lot streaming. International Journal of Production Research,, 43, 1515–1536.
Chen, J. & Steiner, G. (1996). Lot streaming with detached setups in three-machine flow shops. European Journal of Operational Research, 96, 591–611.
Chiu, H. N., Chang, J. H., & Lee, C. H. (2004). Lot streaming models with a limited number of capacitated transporters in multistage batch production systems. Computers & Operations Research, 31, 2003–2020.
Feldmann, M. & Biskup, D. (2008). Lot streaming in a multiple product permutation flow shop with intermingling. International Journal of Production Research, 46, 197–216.
Glass, C., JND, G., & Potts, C. (1994). Lot streaming in three-stage process. European Journal of Operations Research, 75, 378–394.
Hall, N. G., Laporte, G., Selvarajah, E., & Srikandarajah, C. (2003). Scheduling and lot streaming in flow shops with no-wait in process. Journal of Scheduling, 6, 339–354.
Janiak, A., Kozan, E., Lichtenstein, M., & Oğuzc, C. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics, 105, 407–424.
Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2007). Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. International Journal of Advanced Manufacturing Technology, 37, 354–370.
Kumar, S., Bagchi, T., & Sriskandarajah, C. (2000). Lot streaming and scheduling heuristics for m-machine no-wait flow shop. Computers and Industrial Engineering, 38, 149–172.
Liu, S. C. (2003). A heuristic method for discrete lot streaming with variable sublots in a flow shop. International Journal of Advanced Manufacturing Technology, 22, 662–668.
Marimuthu, S., Ponnambalam, S. G., & Jawahar, A. N. (2008). Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 24, 125–139.
Martin, C. H., (2009). A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. OMEGA International Journal of Management Sciences, 37, 126–137.
Oğuzc, C., Zinder, Y., Do, V. H., Janiak, A., & Lichtenstein, M., (2004). Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal of Operational Research, 152, 115–131.
Oğuzc, C. & Frinket, M. E. (2005). A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling, 8, 323–351.
Potts, C. & Baker, K. (1989). Flow shop scheduling with lot streaming. Operations Research Letter, 8, 297–303.
Reiter, S. (1966). A system for managing job shop production. Journal of Business, 34, 371–393.
Ruiz, R., Şerifoğlub, F. S., & Urlings, T., (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research, 35, 1151–1175.
Ruiz, R. & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169, 781–800.
Sen, A., Topaloglu, E., & Benli, O. S. (1998). Optimal streaming of a single job in a two-stage flow shop. European Journal of Operational Research, 110, 42–62.
Sriskandarajah, C. & Wagneur, E. (1999). Lot streaming and scheduling multiple products in two-machine no-wait flow shop. IIE Transactions, 31, 695–707.
Tang, L., Liu, W., & Liu, J., (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16, 361–370.
Tang, L., Xuan, H., & Liu, J. (2006). A new lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Computers & Operations Research, 33, 3344–3359.
Trietsch, D. & Baker, K., (1993). Basic techniques for lot streaming. Operations Research, 41, 1065–1076.
Tseng, C. T. & Liao, C. J. (2008). A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research, 191, 360–373.
Vickson, R. G. & Alfredsson, B. E. (1992). Two and three machines flow shop scheduling problems with equal sized transfer batches. International Journal of Production Research, 30, 1551–1574.
Xiao, W., Hao, P., Zhang, S., & Xu, X. (2000). Hybrid flow shop scheduling using genetic algorithms. Proceedings of the 3rd World Congress on Intelligent Control and Automation. Hefei, P.R. China, pp. 537–541.
Ying, K.-C. & Lin, S.-W. (2006). Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. International Journal of Production Research, 44, 3161–3177.
Zandieh, M., Fatemi Ghomi, S. M. T., & Moattar Husseini, S. M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180, 111–127.
Zhang, W., Yin, C., Liu, J., & Linn, R. J. (2005). Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. International Journal of Production Economics, 96, 189–200.
Baker, K. R. & Jia, D., (1993). A comparative study of lot streaming procedures. OMEGA International Journal of Management Sciences, 21, 561–566.
Bertel, S. & Billaut, J. C. (2004). A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. European Journal of Operational Research, 159, 651–662.
Biskup, D. & Feldmann, M. (2006). Lot streaming with varaibal sublots: an integer programming formulation. Journal of Operational Research Society, 57, 296–303.
Blackburn, J. (1991). Time-Based Competition. Business One Irwin, Burr Ridge, IL,
Bockerstette, J. & Shell, R. (1993). Time Based Manufacturing. McGraw-Hill, New York,
Botta-Genoulaz, V. (2000). Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics, 64, 101–111.
Bukchin, J. & Masin, M. (2004). Multi-objective lot splitting for a single product m-machine flowshop line. IIE Transactions, 36, 191–202.
Chang, J. H. & Chiu, H. N. (2005). A comprehensive review of lot streaming. International Journal of Production Research,, 43, 1515–1536.
Chen, J. & Steiner, G. (1996). Lot streaming with detached setups in three-machine flow shops. European Journal of Operational Research, 96, 591–611.
Chiu, H. N., Chang, J. H., & Lee, C. H. (2004). Lot streaming models with a limited number of capacitated transporters in multistage batch production systems. Computers & Operations Research, 31, 2003–2020.
Feldmann, M. & Biskup, D. (2008). Lot streaming in a multiple product permutation flow shop with intermingling. International Journal of Production Research, 46, 197–216.
Glass, C., JND, G., & Potts, C. (1994). Lot streaming in three-stage process. European Journal of Operations Research, 75, 378–394.
Hall, N. G., Laporte, G., Selvarajah, E., & Srikandarajah, C. (2003). Scheduling and lot streaming in flow shops with no-wait in process. Journal of Scheduling, 6, 339–354.
Janiak, A., Kozan, E., Lichtenstein, M., & Oğuzc, C. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics, 105, 407–424.
Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2007). Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. International Journal of Advanced Manufacturing Technology, 37, 354–370.
Kumar, S., Bagchi, T., & Sriskandarajah, C. (2000). Lot streaming and scheduling heuristics for m-machine no-wait flow shop. Computers and Industrial Engineering, 38, 149–172.
Liu, S. C. (2003). A heuristic method for discrete lot streaming with variable sublots in a flow shop. International Journal of Advanced Manufacturing Technology, 22, 662–668.
Marimuthu, S., Ponnambalam, S. G., & Jawahar, A. N. (2008). Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robotics and Computer-Integrated Manufacturing, 24, 125–139.
Martin, C. H., (2009). A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. OMEGA International Journal of Management Sciences, 37, 126–137.
Oğuzc, C., Zinder, Y., Do, V. H., Janiak, A., & Lichtenstein, M., (2004). Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal of Operational Research, 152, 115–131.
Oğuzc, C. & Frinket, M. E. (2005). A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling, 8, 323–351.
Potts, C. & Baker, K. (1989). Flow shop scheduling with lot streaming. Operations Research Letter, 8, 297–303.
Reiter, S. (1966). A system for managing job shop production. Journal of Business, 34, 371–393.
Ruiz, R., Şerifoğlub, F. S., & Urlings, T., (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research, 35, 1151–1175.
Ruiz, R. & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169, 781–800.
Sen, A., Topaloglu, E., & Benli, O. S. (1998). Optimal streaming of a single job in a two-stage flow shop. European Journal of Operational Research, 110, 42–62.
Sriskandarajah, C. & Wagneur, E. (1999). Lot streaming and scheduling multiple products in two-machine no-wait flow shop. IIE Transactions, 31, 695–707.
Tang, L., Liu, W., & Liu, J., (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16, 361–370.
Tang, L., Xuan, H., & Liu, J. (2006). A new lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. Computers & Operations Research, 33, 3344–3359.
Trietsch, D. & Baker, K., (1993). Basic techniques for lot streaming. Operations Research, 41, 1065–1076.
Tseng, C. T. & Liao, C. J. (2008). A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research, 191, 360–373.
Vickson, R. G. & Alfredsson, B. E. (1992). Two and three machines flow shop scheduling problems with equal sized transfer batches. International Journal of Production Research, 30, 1551–1574.
Xiao, W., Hao, P., Zhang, S., & Xu, X. (2000). Hybrid flow shop scheduling using genetic algorithms. Proceedings of the 3rd World Congress on Intelligent Control and Automation. Hefei, P.R. China, pp. 537–541.
Ying, K.-C. & Lin, S.-W. (2006). Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. International Journal of Production Research, 44, 3161–3177.
Zandieh, M., Fatemi Ghomi, S. M. T., & Moattar Husseini, S. M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180, 111–127.
Zhang, W., Yin, C., Liu, J., & Linn, R. J. (2005). Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops. International Journal of Production Economics, 96, 189–200.