A competitive constraint programming approach for the group shop scheduling problem

Vista sencilla de ítem
dc.contributor.authorYuraszeck, Francisco
dc.contributor.authorMejia, Gonzalo
dc.contributor.authorCanut-De-Bon, Dario
dc.date.accessioned2024-04-16T20:41:53Z
dc.date.available2024-04-16T20:41:53Z
dc.date.issued2023-03
dc.descriptionIndexación: Scopus.
dc.description.abstractIn this paper, we propose a competitive Constraint Programming (CP) approach to solve the Group Shop Scheduling Problem (GSSP) under the makespan minimization criteria. Our contribution is two-fold: we provide a flexible mathematical formulation to solve the GSSP that can be used without change to solve other closed-related scheduling problems such as the Open Shop Scheduling Problem (OSSP), Job Shop Scheduling Problem (JSSP), and Mixed Shop Scheduling Problem (MSSP); and we improve several lower bounds and upper bounds from 130 classical GSSP instances from the literature. We evaluate our approach by comparing the performance with competitive methods mainly based on metaheuristics, where we were able to prove optimality in more than 85% of the instances in competitive running time, with a relative percentage deviation lower than 3% on average. In contrast to metaheuristics approaches, our CP method does not require calibrations of multiple parameters, several replicates for each instance, and complex computational coding to be competitive in both, solution quality and computational running times. © 2023 Elsevier B.V.. All rights reserved.
dc.description.urihttps://www-sciencedirect-com.recursosbiblioteca.unab.cl/science/article/pii/S1877050923006658?via%3Dihub
dc.identifier.citationProcedia Computer Science. Volume 220, Pages 946 - 951. 2023. 14th International Conference on Ambient Systems, Networks and Technologies Networks, ANT 2023 and The 6th International Conference on Emerging Data and Industry 4.0, EDI40 2023. Leuven. 15 March 2023through 17 March 2023. Code 189712
dc.identifier.doi10.1016/j.procs.2023.03.130
dc.identifier.issn1877-0509
dc.identifier.urihttps://repositorio.unab.cl/handle/ria/56056
dc.language.isoen
dc.publisherElsevier B.V.
dc.rights.licenseCC BY-NC-ND 4.0 DEED Attribution-NonCommercial-NoDerivs 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectConstraint programming
dc.subjectGroup shop
dc.subjectMetaheuristics
dc.subjectMixed shop
dc.subjectScheduling
dc.subjectStage shop
dc.titleA competitive constraint programming approach for the group shop scheduling problem
dc.typeArtículo
Archivos
Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
Yuraszeck_A_competitive_constraint_programming_approach_2023.pdf
Tamaño:
480.17 KB
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