Improved bounded dynamic programming algorithm for solving the blocking flow shop problem

  • Ansis OzolinsEmail author
Original Paper


In this paper, the blocking flow shop problem is considered. An exact algorithm for solving the blocking flow shop problem is developed by means of the bounded dynamic programming approach. The proposed algorithm is tested on several well-known benchmark instances. Computational results show that the presented algorithm outperforms all the state-of-the-art exact algorithms known to the author. Additionally, the optimality is proven for 26 previously open instances. Furthermore, we provide new lower bounds for several benchmark problem sets of Taillard requiring a relatively short CPU time.


Scheduling Blocking flow shop Bounded dynamic programming Exact method 


  1. Bautista J, Cano A, Companys R, Ribas I (2012) Solving the \(Fm|block|Cmax\) problem using bounded dynamic programming. Eng Appl Artif Intell 25(6):1235–1245CrossRefGoogle Scholar
  2. Companys R, Mateo M (2007) Different behaviour of a double branch-and-bound algorithm on \(Fm|prmu|Cmax\) and \(Fm|block|Cmax\) problems. Comput Oper Res 34(4):938–953CrossRefGoogle Scholar
  3. Companys R, Ribas I (2011) New insights on the blocking flow shop problem. Best solutions update. Tech. rep., working paperGoogle Scholar
  4. Gilmore P, Gomory R (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655–679CrossRefGoogle Scholar
  5. Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. A tabu search approach. Omega 35(3):302–311Google Scholar
  6. Gromicho J, Van Hoorn J, Saldanha-da Gama F, Timmer G (2012) Solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper Res 39(12):2968–2977CrossRefGoogle Scholar
  7. Hall N, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper res 44(3):510–525CrossRefGoogle Scholar
  8. Heller J (1960) Some numerical experiments for an \(M\times J\) flow shop and its decision-theoretical aspects. Oper Res 8(2):178–184CrossRefGoogle Scholar
  9. Lenstra J, Rinnooy Kan A, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrec Math 1:343–362CrossRefGoogle Scholar
  10. Lin S, Ying K (2013) Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41(2):383–389CrossRefGoogle Scholar
  11. Pan Q, Wang L, Sang H, Li J, Liu M (2013) A high performing memetic algorithm for the flowshop scheduling problem with blocking. IEEE Trans Auto Sci Eng 10(3):741–756CrossRefGoogle Scholar
  12. Papadimitriou C, Kanellakis P (1980) Flowshop scheduling with limited temporary storage. J ACM (JACM) 27(3):533–549CrossRefGoogle Scholar
  13. Reddi S, Ramamoorthy C (1972) On the flow-shop sequencing problem with no wait in process. Oper Res Quart pp 323–331Google Scholar
  14. Reeves C (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5–13CrossRefGoogle Scholar
  15. Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3):293–301CrossRefGoogle Scholar
  16. Ronconi D (2005) A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann Oper Res 138(1):53–65CrossRefGoogle Scholar
  17. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285CrossRefGoogle Scholar
  18. Tasgetiren M, Pan Q, Suganthan P, Buyukdagli O (2013) A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput Oper Res 40(7):1729–1743CrossRefGoogle Scholar
  19. Tasgetiren M, Pan Q, Kizilay D, Suer G (2015) A populated local search with differential evolution for blocking flowshop scheduling problem. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp 2789–2796Google Scholar
  20. Tasgetiren M, Kizilay D, Pan Q, Suganthan P (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77:111–126CrossRefGoogle Scholar
  21. van Hoorn JJ (2016) Dynamic programming for routing and scheduling: Optimizing sequences of decisionsGoogle Scholar
  22. van Hoorn JJ, Nogueira A, Ojea I, Gromicho JA (2016) An corrigendum on the paper: solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper ResGoogle Scholar
  23. Wang L, Pan Q, Suganthan P, Wang W, Wang Y (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509–520CrossRefGoogle Scholar
  24. Zhang C, Xie Z, Shao X, Tian G (2015) An effective VNSSA algorithm for the blocking flowshop scheduling problem with makespan minimization. In: 2015 International Conference on Advanced Mechatronic Systems (ICAMechS), IEEE, pp 86–89Google Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.University of LatviaRigaLatvia

Personalised recommendations