A bounded dynamic programming algorithm for the blocking flow shop problem

dc.contributor.authorBautista Valhondo, Joaquín
dc.contributor.authorCano Pérez, Alberto
dc.contributor.authorCompanys Pascual, Ramón
dc.contributor.authorRibas Vila, Immaculada
dc.contributor.groupUniversitat Politècnica de Catalunya. OPE-PROTHIUS - Organització de la Producció en Tallers Híbrids
dc.contributor.groupUniversitat Politècnica de Catalunya. DOPS - Disseny i Optimització de Processos i Serveis
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2016-10-18T10:07:42Z
dc.date.issued2011-04-11
dc.description.abstractWe 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 wellknown Taillard instances. We have improved the best-known solutions for four of the Taillard’s instances
dc.description.versionPostprint (published version)
dc.format.extent8 p.
dc.identifier.citationBautista, J., Cano, A., Companys , R., Ribas, I. A bounded dynamic programming algorithm for the blocking flow shop problem. A: "2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings". Los Alamitos (California): IEEE Computer Society Conference Publishing Services (CPS), 2011, p. 8-15.
dc.identifier.isbn978-1-61284-332-2
dc.identifier.urihttps://hdl.handle.net/2117/90832
dc.language.isoeng
dc.publisherIEEE Computer Society Conference Publishing Services (CPS)
dc.relation.publisherversionhttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5937060
dc.rights.accessRestricted access - publisher's policy
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.lcshHeuristic algorithms
dc.subject.lemacHeurística
dc.subject.lemacAlgorismes
dc.subject.otherScheduling
dc.subject.otherBDP algorithms
dc.subject.otherblocking flow shop
dc.titleA bounded dynamic programming algorithm for the blocking flow shop problem
dc.typePart of book or chapter of book
dspace.entity.typePublication
local.citation.authorBautista, J.; Cano, A.; Companys, R.; Ribas, I.
local.citation.endingPage15
local.citation.publicationName2011 IEEE Workshop On Computational Intelligence In Production And Logistics Systems (CIPLS 2011) Proceedings
local.citation.pubplaceLos Alamitos (California)
local.citation.startingPage8
local.identifier.drac18820636

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Carregant...
Miniatura
Nom:
IEEE_SSCI_2011_CIPLS_BFS.pdf
Mida:
9.01 MB
Format:
Adobe Portable Document Format
Descarregar (Accés restringit) Sol·licita una còpia a l'autor