A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model

Abstract: In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

How to cite this paper

 Rossit, D., Tohmé, F., Frutos, M., Bard, J & Broz, D. (2016). A non-permutation flowshop scheduling problem with lot streaming: A Mathematical model.International Journal of Industrial Engineering Computations , 7(3), 507-516.

Refrences

Azzi, A., Faccio, M., Persona, A., & Sgarbossa, F. (2012). Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production. International Journal of Advanced Manufacturing Technology, 59(5-8), 775-786.

Davendra, D., Senkerik, R., Zelinka, I., Pluhacek, M., & Bialic-Davendra, M. (2014). Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time. Soft Computing, 18(4), 669-681.

Defersha, F. M. (2011). A comprehensive mathematical model for hybrid flexible flowshop lot streaming problem. International Journal of Industrial Engineering Computations, 2(2), 283-294.

Defersha, F. M., & Chen, M. (2012). Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem. The International Journal of Advanced Manufacturing Technology, 62(1-4), 249-265.

Kumar, S., Bagchi, T. P., & Sriskandarajah, C. (2000). Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Computers & Industrial Engineering, 38(1), 149-172.

Liao, C. J., Liao, L. M., & Tseng, C. T. (2006). A performance evaluation of permutation vs. non-permutation schedules in a flowshop. International Journal of Production Research, 44(20), 4297-4309.

Lin, S. W., & Ying, K. C. (2009). Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems. International Journal of Production Research, 47(5), 1411-1424.

Mehravaran, Y., & Logendran, R. (2012). Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. International Journal of Production Economics, 135(2), 953-963.

Mehravaran, Y., & Logendran, R. (2013). Non-permutation flowshop scheduling with dual resources. Expert Systems with Applications, 40(13), 5061-5076.

Pan, Q. K., Tasgetiren, M. F., Suganthan, P. N., & Chua, T. J. (2011). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information sciences, 181(12), 2455-2468.

Pan, Q. K., & Ruiz, R. (2012). An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega, 40(2), 166-180.

Pinedo, M. (2002). Scheduling: Theory, Algorithms and Systems, 2nd ed., Prentice-Hall.

Potts, C. N., & Baker, K. R. (1989). Flow shop scheduling with lot streaming. Operations research letters, 8(6), 297-303.

Pugazhendhi, S., Thiagarajan, S., Rajendran, C., & Anantharaman, N. (2003). Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems. Computers & Industrial Engineering, 44(1), 133-157.

Reiter, S. (1966). A system for managing job shop production. Journal of Business, 34, 371–393.

Rossi, A., & Lanzetta, M. (2014). Native metaheuristics for non-permutation flowshop scheduling. Journal of Intelligent Manufacturing, 25(6), 1221-1233.

Ruiz, R., ?erifo?lu, F. S., & Urlings, T. (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research, 35(4), 1151-1175.

Sarin, S. C., & Jaiprakash, P. (2007). Flow shop lot streaming. Springer Science & Business Media.

Shen, L., Gupta, J. N., & Buscher, U. (2014). Flow shop batching and scheduling with sequence-dependent setup times. Journal of Scheduling, 17(4), 353-370.

Sriskandarajah, C., & Wagneur, E. (1999). Lot streaming and scheduling multiple products in two-machine no-wait flowshops. IIE transactions, 31(8), 695-707.

Taillard, E. (1993). Benchmarks for basic scheduling problems. european journal of operational research, 64(2), 278-285.

Trietsch, D., & Baker, K. R. (1993). Basic techniques for lot streaming.Operations Research, 41(6), 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(2), 360-373.

Vahedi-Nouri, B., Fattahi, P., & Ramezanian, R. (2013). Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. Journal of Manufacturing Systems, 32(1), 167-173.

Vickson, R. G. (1995). Optimal lot streaming for multiple products in a two-machine flow shop. European Journal of Operational Research, 85(3), 556-575.

Wang, L. C., Chen, Y. Y., Chen, T. L., Cheng, C. Y., & Chang, C. W. (2014). A hybrid flowshop scheduling model considering dedicated machines and lot-splitting for the solar cell industry. International Journal of Systems Science,45(10), 2055-2071.

Ying, K. C. (2008). Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. The International Journal of Advanced Manufacturing Technology, 38(3-4), 348-354.

Ying, K. C., Gupta, J. N., Lin, S. W., & Lee, Z. J. (2010). Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. International Journal of Production Research, 48(8), 2169-2184.

Yoon, S. H., & Ventura, J. A. (2002). An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Transactions, 34(9), 779-787.

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(2), 189-200.