We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known solutions for four of the Taillard’s instances
Bautista, J., Cano, A., Companys , R., Ribas, I. A bounded dynamic programming algorithm for the blocking flow shop problem. A: "2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings". Los Alamitos (California): IEEE Computer Society Conference Publishing Services (CPS), 2011, p. 8-15.