Title of article :
Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming
Author/Authors :
Bautista، نويسنده , , Joaquيn and Cano، نويسنده , , Alberto and Companys، نويسنده , , Ramon and Ribas، نويسنده , , Imma، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2012
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.
Keywords :
Blocking flow shop , Scheduling , production , logistics , Dynamic programming , Meta-heuristics
Journal title :
Engineering Applications of Artificial Intelligence
Journal title :
Engineering Applications of Artificial Intelligence
