JIT: Just In Time / Douki Seisan sequencing


  • Solving flow shop problems with 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 the bounded dynamic programming algorithms to solve the Fm|prmu|Cmax and the Fm|block|Cmax problems using as experimental data the well-known Taillard instances. We have improved four of the 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



Return to previous page