Solving the Fm|block|Cmax problem using bounded dynamic programming
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 fr...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/14056 |
| Acceso en línea: | https://hdl.handle.net/2117/14056 https://dx.doi.org/10.1016/j.engappai.2011.09.001 |
| Access Level: | acceso abierto |
| Palabra clave: | Industrial management. Heuristic algorithms Heurística Empreses -- Planificació Algorismes Àrees temàtiques de la UPC::Economia i organització d'empreses |
| Sumario: | 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. |
|---|