Mostrar el registro sencillo del ítem

dc.contributor.authorMontoya-Torres J.R.
dc.contributor.authorMoreno-Camacho C.A.
dc.contributor.authorVélez-Gallego M.C.
dc.date.accessioned2024-05-02T14:21:31Z
dc.date.available2024-05-02T14:21:31Z
dc.date.issued2023
dc.identifier.citationMontoya-Torres, J.R., Moreno-Camacho, C.A., Vélez-Gallego, M.C. Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times (2023) Journal of the Operational Research Society, 74 (3), pp. 873-887es_CO
dc.identifier.issn1605682
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85132657001&doi=10.1080%2f01605682.2022.2064781&partnerID=40&md5=84ccc769c1e190f3cb73acc6cb4ab49d
dc.identifier.urihttp://hdl.handle.net/10818/59943
dc.description15 páginases_CO
dc.description.abstractThis article studies the problem of job scheduling in hand-intensive manufacturing with processing times that deteriorate depending on the sequence in order to minimize the maximum delay of the set of jobs. In the literature, only a small number of academic works has considered the assumption of non-stationary workers during the planning horizon. This problem is NP-hard since it is as an extension of the parallel machine scheduling problem with makespan minimization, which is itself NP-hard. A variable neighbourhood search (VNS) algorithm is presented to solve this problem; its efficiency is evaluated through an extended set of numerical experiments with random-generated datasets. Results are compared with an exact method based on mathematical programming. The results show that the VNS algorithm provides good solutions in reasonable computing times even for large problems. © 2022 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.en
dc.formatapplication/pdfes_CO
dc.publisherJournal of the Operational Research Societyes_CO
dc.relation.ispartofseriesJournal of the Operational Research Society 74 (3), pp. 873-887
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.sourceUniversidad de La Sabanaes_CO
dc.sourceIntellectum Repositorio Universidad de La Sabanaes_CO
dc.subject.otherIdentical Workersen
dc.subject.otherPosition-Dependent Processing Timesen
dc.subject.otherSchedulingen
dc.subject.otherVariable Neighbourhood Searchen
dc.titleVariable neighbourhood search for job scheduling with position-dependent deteriorating processing timesen
dc.typejournal articlees_CO
dc.type.hasVersionpublishedVersiones_CO
dc.rights.accessRightsopenAccesses_CO
dc.identifier.doi10.1080/01605682.2022.2064781


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 InternationalExcepto si se señala otra cosa, la licencia del ítem se describe como Attribution-NonCommercial-NoDerivatives 4.0 International