dc.creator | Framiñán Torres, José Manuel | es |
dc.creator | Pérez González, Paz | es |
dc.date.accessioned | 2020-05-14T10:54:19Z | |
dc.date.available | 2020-05-14T10:54:19Z | |
dc.date.issued | 2017-12 | |
dc.identifier.citation | Framiñán Torres, J.M. y Pérez González, P. (2017). The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic. Computers & Operations Research, 88, 237-246. | |
dc.identifier.issn | 0305-0548 | es |
dc.identifier.uri | https://hdl.handle.net/11441/96664 | |
dc.description.abstract | In this paper, we address the 2-stage assembly scheduling problem where there are m machines in the first stage to manufacture the components of a product and one assembly station (machine) in the second stage. The objective considered is the minimisation of the total completion time. Since the NP-hard nature of this problem is well-established, most previous research has focused on finding approximate solutions in reasonable computation time. In our paper, we first review and derive a number of problem properties and, based on these ideas, we develop a constructive heuristic that outperforms the existing constructive heuristics for the problem, providing solutions almost in real-time. Finally, for the cases where extremely high-quality solutions are required, a variable local search algorithm is proposed. The computational experience carried out shows that the algorithm outperforms the best existing metaheuristic for the problem. As a summary, the heuristics presented in the paper substantially modify the state-of-the-art of the approximate methods for the 2-stage assembly scheduling problem with total completion time objective. | es |
dc.format | application/pdf | es |
dc.format.extent | 10 p. | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Computers & Operations Research, 88, 237-246. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Scheduling Assembly | es |
dc.subject | Completion time | es |
dc.subject | Heuristics | es |
dc.title | The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/acceptedVersion | 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.projectID | DPI2013-44461-P | es |
dc.relation.publisherversion | https://www--sciencedirect--com.us.debiblio.com/science/article/pii/S030505481730196X | es |
dc.identifier.doi | 10.1016/j.cor.2017.07.012 | es |
dc.contributor.group | Universidad de Sevilla. TEP134: Organización Industrial | es |
idus.validador.nota | Embargo de 3 años por requerimientos del editor Elsevier | es |
dc.journaltitle | Computers & Operations Research | es |
dc.publication.volumen | 88 | es |
dc.publication.initialPage | 237 | es |
dc.publication.endPage | 246 | es |
dc.contributor.funder | Ministerio de Ciencia, Innovación y Universidades (MICINN). España | es |