article · RECERCAT (Consorci de Serveis Universitaris de Catalunya)

A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem

Bautista Valhondo, Joaquín, Cano Pérez, Alberto, Companys Pascual, Ramón, Ribas Vila, Immaculada

Cited by 0Open access

Abstract

We present some results attained with two variants of bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown\nTaillard instances. We have improved the best known solutions for four of the Taillard’s instances.

Cite this paper

APA 7

Bautista Valhondo, J., Cano Pérez, A., Companys Pascual, R., & Ribas Vila, I. (n.d.). A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem. RECERCAT (Consorci de Serveis Universitaris de Catalunya).

MLA 9

Bautista Valhondo, Joaquín, et al. “A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem.” RECERCAT (Consorci de Serveis Universitaris de Catalunya).

Chicago

Bautista Valhondo, Joaquín, Alberto Cano Pérez, Ramón Companys Pascual, and Immaculada Ribas Vila. n.d.. “A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem.” RECERCAT (Consorci de Serveis Universitaris de Catalunya).

Harvard

Bautista Valhondo, J. et al. (n.d.) ‘A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem’, RECERCAT (Consorci de Serveis Universitaris de Catalunya).

BibTeX

@article{bautistavalhondobounded,
  title = {{A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem}},
  author = {Bautista Valhondo, Joaquín and Cano Pérez, Alberto and Companys Pascual, Ramón and Ribas Vila, Immaculada},
  journal = {RECERCAT (Consorci de Serveis Universitaris de Catalunya)}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.