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

• 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–1245

  Article  Google Scholar 

• 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–953

  Article  Google Scholar 

• Companys R, Ribas I (2011) New insights on the blocking flow shop problem. Best solutions update. Tech. rep., working paper

• Gilmore P, Gomory R (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655–679

  Article  Google Scholar 

• Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. A tabu search approach. Omega 35(3):302–311

  Google Scholar 

• 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–2977

  Article  Google Scholar 

• Hall N, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper res 44(3):510–525

  Article  Google Scholar 

• Heller J (1960) Some numerical experiments for an \(M\times J\) flow shop and its decision-theoretical aspects. Oper Res 8(2):178–184

  Article  Google Scholar 

• Lenstra J, Rinnooy Kan A, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrec Math 1:343–362

  Article  Google Scholar 

• Lin S, Ying K (2013) Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41(2):383–389

  Article  Google Scholar 

• 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–756

  Article  Google Scholar 

• Papadimitriou C, Kanellakis P (1980) Flowshop scheduling with limited temporary storage. J ACM (JACM) 27(3):533–549

  Article  Google Scholar 

• Reddi S, Ramamoorthy C (1972) On the flow-shop sequencing problem with no wait in process. Oper Res Quart pp 323–331

• Reeves C (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5–13

  Article  Google Scholar 

• Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3):293–301

  Article  Google Scholar 

• Ronconi D (2005) A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann Oper Res 138(1):53–65

  Article  Google Scholar 

• Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285

  Article  Google Scholar 

• 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–1743

  Article  Google Scholar 

• 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–2796

• 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–126

  Article  Google Scholar 

• van Hoorn JJ (2016) Dynamic programming for routing and scheduling: Optimizing sequences of decisions

• 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 Res

• 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–520

  Article  Google Scholar 

• 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–89

Download references