Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Francisco Yuraszeck"'
Publikováno v:
IEEE Access, Vol 11, Pp 144928-144938 (2023)
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. Th
Externí odkaz:
https://doaj.org/article/3cd517a066114506a5f97d6d535f09c0
Publikováno v:
Mathematics, Vol 10, Iss 3, p 329 (2022)
This work addresses a particular case of the group shop scheduling problem (GSSP) which will be denoted as the fixed group shop scheduling problem (FGSSP). In a FGSSP, job operations are divided into stages and each stage has a set of machines associ
Externí odkaz:
https://doaj.org/article/6a9498d854a34096b790a52c110d21af
Publikováno v:
Procedia Computer Science. 220:946-951
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::233b1545e40d463bf301f41e1332a233
https://doi.org/10.1016/j.procs.2023.03.130
https://doi.org/10.1016/j.procs.2023.03.130
Autor:
Francisco Yuraszeck, Gonzalo Mejía
Publikováno v:
European Journal of Operational Research. 285:484-496
In this paper, we study Open Shop Scheduling Problems (OSSPs) that involve (1) travel times between machines and/or (2) sequence-dependent setup times. First, we propose a new decoding scheme on the well-known permutation list representation and stud
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::895f0ef4b61e38a934711740a1b3c50f
https://doi.org/10.1016/j.ejor.2020.02.010
https://doi.org/10.1016/j.ejor.2020.02.010