| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 380937 | Engineering Applications of Artificial Intelligence | 2012 | 11 Pages |
Abstract
We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm|block|Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard's instances, including the 10 instances from set 12.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Joaquín Bautista, Alberto Cano, Ramon Companys, Imma Ribas,