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
Chica, M., Cordón, O., Bautista, J., Damas, S. A multiobjective memetic ant colony optimization algorithm for the 1/3 variant of the time and space assembly line balancing 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. 16-22.