JIT: Just In Time / Douki Seisan sequencing


  • Solving the Fm|block|Cmax Problem using Bounded Dynamic Programming

(article)

Authors


Joaquin Bautista1, Alberto Cano1, Ramón Companys2 and Imma Ribas2

 

1 UPC - Nissan Chair

2 DOE - UPC


Abstract


We present some results attained with two variants of bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of the Taillard’s instances, including the 10 instances from set 12.



New best solutions for the BFSP. Download here

 



Return to previous page