A bounded dynamic programming algorithm for the blocking flow shop problem
View/Open
IEEE_SSCI_2011_CIPLS_BFS.pdf (9,012Mb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/90832
Document typePart of book or chapter of book
Defense date2011-04-11
PublisherIEEE Computer Society Conference Publishing Services (CPS)
Rights accessRestricted access - publisher's policy
This work is protected by the corresponding intellectual and industrial property rights.
Except where otherwise noted, its contents are licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
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 wellknown Taillard instances. We have improved the best-known solutions for four of the Taillard’s instances
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.
ISBN978-1-61284-332-2
Publisher versionhttp://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5937060
Files | Description | Size | Format | View |
---|---|---|---|---|
IEEE_SSCI_2011_CIPLS_BFS.pdf![]() | 9,012Mb | Restricted access |