Solving the Fm\block\Cmax problem using Bounded Dynamic Programming

Authors:
JoaquíN Bautista;Alberto Cano;Ramon Companys;Imma Ribas
Affiliations:
Nissan Chair, Escola Tècnica Superior d'Enginyeria de Barcelona, Universitat Politècnica de Catalunya, Barcelona, Spain;Nissan Chair, Escola Tècnica Superior d'Enginyeria de Barcelona, Universitat Politècnica de Catalunya, Barcelona, Spain;Departament d'Organització d'Empreses, Escola Tècnica Superior d'Enginyeria de Barcelona, Universitat Politècnica de Catalunya, Barcelona, Spain;Departament d'Organització d'Empreses, Escola Tècnica Superior d'Enginyeria de Barcelona, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
Engineering Applications of Artificial Intelligence
Year:
2012

Citing 7
Cited 0

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
An improved discrete dynamic programming algorithm for allocating resources among interdependent projects

Management Science
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Minimizing Cycle Time in a Blocking Flowshop

Operations Research
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm|block|C"m"a"x 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.