Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.engappai.2011.09.001 | Engineering Applications of Artificial Intelligence |
Keywords | DocType | Volume |
Blocking flow shop,Scheduling,Production,Logistics,Dynamic programming,Meta-heuristics | Journal | 25 |
Issue | ISSN | Citations |
6 | 0952-1976 | 2 |
PageRank | References | Authors |
0.39 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joaquín Bautista | 1 | 345 | 27.50 |
| Alberto Cano | 2 | 269 | 18.88 |
| Ramón Companys | 3 | 12 | 2.02 |
| Imma Ribas | 4 | 77 | 5.30 |