Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars

Συγγραφείς: Povéda, Guillaume, Alvarez, Nahum, Artigues, Christian

Συνεισφορές: Guillaume Povéda and Nahum Alvarez and Christian Artigues, Artigues, Christian

Θεματικοί όροι: large neighborhood search, constraint programming, Applied computing → Industry and manufacturing, 2012 ACM Subject Classification Computing methodologies → Planning and scheduling Applied computing → Industry and manufacturing Theory of computation → Optimization with randomized search heuristics Theory of computation → Constraint and logic programming phrases Large-scale scheduling problem, Large-scale scheduling problem, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], multi-mode, Theory of computation → Constraint and logic programming, Theory of computation → Optimization with randomized search heuristics, Computing methodologies → Planning and scheduling, Theory of computation → Constraint and logic programming phrases Large-scale scheduling problem, partial preemption, multi-skill, ddc:004, resource calendars

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.31
https://laas.hal.science/hal-04217223v1/document
https://doi.org/10.4230/lipics.cp.2023.31
https://laas.hal.science/hal-04217223v1