Resumen de Solving Flow Shop Problemswith Bounded Dynamic Programming
Joaquín Bautista Valhondo, Alberto Cano Alsúa, Ramón Companys Pascual, Imma Ribas Vila
We present some results attained with the bounded dynamic programming algorithms to solve the Fm|prmu|Cmax and the Fm|block|Cmax problems using the well-known Taillard instances as experimental data. We have improved four ofthe best-known solutions of the Taillard’s instances for the Fm|block|Cmax problem and we have confirmed the optimality of six solutions for the Fm|prmu|Cmax case.
