Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times

Jairo R. Montoya-Torres, Carlos A. Moreno-Camacho and Mario C. Vélez-Gallego

Journal of the Operational Research Society, 2023, vol. 74, issue 3, 873-887

Abstract: This 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.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2022.2064781 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:74:y:2023:i:3:p:873-887

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2022.2064781

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().