• DocumentCode
    2291402
  • Title

    A bounded dynamic programming algorithm for the blocking flow shop problem

  • Author

    Bautista, Joaquín ; Cano, Alberto ; Companys, Ramon ; Ribas, Imma

  • Author_Institution
    Escola Tec. Super. d´´Eng. de Barcelona, Univ. Politec. de Catalunya, Barcelona, Spain
  • fYear
    2011
  • fDate
    11-15 April 2011
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the well-known Taillard instances. We have improved the best-known solutions for four of the Taillard´s instances.
  • Keywords
    dynamic programming; flow shop scheduling; Fm|block|Cmax problem; Taillard instances; blocking flow shop problem; bounded dynamic programming algorithm; Benchmark testing; Dynamic programming; Equations; Genetic algorithms; Heuristic algorithms; Job shop scheduling; Schedules; BDP algorithms; Scheduling; blocking flow shop;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence In Production And Logistics Systems (CIPLS), 2011 IEEE Workshop On
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-61284-331-5
  • Type

    conf

  • DOI
    10.1109/CIPLS.2011.5953353
  • Filename
    5953353
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2291402