A Constraint Programming Formulation of the Multi-Mode Resource-Constrained Project Scheduling Problem for the Flexible Job Shop Scheduling Problem
No hay miniatura disponible
Archivos
Fecha
2023
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Institute of Electrical and Electronics Engineers Inc.
Nombre de Curso
Licencia CC
CC BY-NC-ND 4.0 Attribution-NonCommercial-NoDerivatives 4.0 International Deed
Licencia CC
https://creativecommons.org/licenses/by-nc-nd/4.0/
Resumen
In 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.
Notas
Indexación: Scopus
Palabras clave
Constraint Programming, FJSSP, Flexible Job Shop, Job Shop, JSSP, MMRCPSP, Multi-Mode Resource-Constrained Project Scheduling Problem, Sequencing Flexibility
Citación
IEEE Access. Volume 11, Pages 144928 - 144938. 2023
DOI
10.1109/ACCESS.2023.3345793