A Constraint Programming Formulation of the Multi-Mode Resource-Constrained Project Scheduling Problem for the Flexible Job Shop Scheduling Problem

Vista sencilla de ítem
dc.contributor.authorYuraszeck, Francisco
dc.contributor.authorMontero, Elizabeth
dc.contributor.authorCanut-De-Bon, Dario
dc.contributor.authorCuneo, Nicolas
dc.contributor.authorRojel, Maximiliano
dc.date.accessioned2024-08-01T16:15:32Z
dc.date.available2024-08-01T16:15:32Z
dc.date.issued2023
dc.descriptionIndexación: Scopus
dc.description.abstractIn this work, a constraint programming (CP) formulation of the multi-mode resource-constrained project scheduling problem (MMRCPSP) is proposed for solving the flexible job shop scheduling problem (FJSSP) under the makespan minimization criterion. The resulting CP model allows us to tackle the classical instances of the FJSSP (such as where the operations of a given job follow a linear order). It can also handle FJSSP instances where the precedence relationships between operations are defined by an arbitrary directed acyclic graph (sequencing flexibility). The performance of our approach was tested using 271 classical FJSSP instances and 50 FJSSP instances with sequencing flexibility. We establish the validity of our approach by achieving an average relative percentage deviation of 3.04% and 0.18% when compared to the best-known lower and upper bounds, respectively. Additionally, we were able to contribute to the literature with ten new lower bounds and two new upper bounds. Our CP approach is relatively simple yet competitive and can be quickly applied and adapted by new practitioners in the area. © 2013 IEEE.
dc.description.urihttps://ieeexplore-ieee-org.recursosbiblioteca.unab.cl/document/10367980
dc.identifier.citationIEEE Access. Volume 11, Pages 144928 - 144938. 2023
dc.identifier.doi10.1109/ACCESS.2023.3345793
dc.identifier.issn2169-3536
dc.identifier.urihttps://repositorio.unab.cl/handle/ria/58946
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.rights.licenseCC BY-NC-ND 4.0 Attribution-NonCommercial-NoDerivatives 4.0 International Deed
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectConstraint Programming
dc.subjectFJSSP
dc.subjectFlexible Job Shop
dc.subjectJob Shop
dc.subjectJSSP
dc.subjectMMRCPSP
dc.subjectMulti-Mode Resource-Constrained Project Scheduling Problem
dc.subjectSequencing Flexibility
dc.titleA Constraint Programming Formulation of the Multi-Mode Resource-Constrained Project Scheduling Problem for the Flexible Job Shop Scheduling Problem
dc.typeArtículo
Archivos
Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
Yuraszeck_A_Constraint_Programming_Formulation_of_the_2023.pdf
Tamaño:
2.81 MB
Formato:
Adobe Portable Document Format
Descripción:
TEXTO COMPLETO EN INGLÉS
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descripción:
Descargar
Colecciones
FIng - Artículos de Revista