Mostrar el registro sencillo del ítem
Artículo
The distributed permutation flow shop to minimise the total flowtime
dc.creator | Fernández-Viagas Escudero, Víctor | es |
dc.creator | Pérez González, Paz | es |
dc.creator | Framiñán Torres, José Manuel | es |
dc.date.accessioned | 2019-04-09T08:34:15Z | |
dc.date.available | 2019-04-09T08:34:15Z | |
dc.date.issued | 2018-04 | |
dc.identifier.citation | Fernández-Viagas, V., Pérez-González, P. y Framiñán, J.M. (2018). The distributed permutation flow shop to minimise the total flowtime. Computers & Industrial Engineering, 118, 464-477. | |
dc.identifier.issn | 0360-8352 | es |
dc.identifier.uri | https://hdl.handle.net/11441/85373 | |
dc.description.abstract | In the last years, researchers are paying special attention to scheduling in distributed environments due to the increasing benefits of multi-factory manufacture. In this paper, we address the distributed permutation flowshop scheduling problem to minimise the total flowtime. Since, to the best of our knowledge, this problem has not been addressed previously, we first analyse it and discuss several properties, theorems, assignment rules, representation of the solutions and speed-up procedures. Given that the problem is NP-hard, we focus on approximate procedures, and propose eighteen constructive heuristics to obtain high-quality solutions in reasonable CPU times. In addition, we propose an iterative improvement algorithm to further refine the so-obtained solutions. The extensive computational experience carried out shows that the proposed method outperforms several metaheuristics adapted from related scheduling problems. | es |
dc.description.sponsorship | Ministerio de Ciencia e Innovación DPI2016-80750-P | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier Ltd | es |
dc.subject | Scheduling | es |
dc.subject | Distributed | es |
dc.subject | Flowshop | es |
dc.subject | Heuristics | es |
dc.subject | PFSP | es |
dc.subject | Total completion time | es |
dc.subject | Flowtime | es |
dc.subject | Evolutionary | es |
dc.subject | Permutation | es |
dc.subject | NEH | es |
dc.subject | Genetic algorithm | es |
dc.title | The distributed permutation flow shop to minimise the total flowtime | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I | es |
dc.relation.projectID | DPI2016-80750-P | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0360835218300986 | es |
dc.identifier.doi | 10.1016/j.cie.2018.03.014 | es |
idus.format.extent | 14 | es |
idus.validador.nota | Versión preprint | es |
dc.journaltitle | Computers & Industrial Engineering | es |
dc.publication.volumen | 118 | es |
dc.publication.initialPage | 464 | es |
dc.publication.endPage | 477 | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
prePrint_idus.pdf | 5.235Mb | [PDF] | Ver/ | Versión Postprint |
Este registro aparece en las siguientes colecciones
Este documento está protegido por los derechos de propiedad intelectual e industrial. Sin perjuicio de las exenciones legales existentes, queda prohibida su reproducción, distribución, comunicación pública o transformación sin la autorización del titular de los derechos, a menos que se indique lo contrario.