An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
Year of publication: |
2020
|
---|---|
Authors: | Van Cauwelaert, Sascha van ; Dejemeppe, Cyrille ; Schaus, Pierre |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 23.2020, 4, p. 431-449
|
Subject: | Constraint programming | scheduling | Global constraint | Unary resource | Transition times | Optional activities | Scalability | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Just-in-time two-dimensional bin packing
Polyakovskiy, Sergey, (2021)
-
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
Fleszar, Krzysztof, (2018)
-
Exact algorithms for a parallel machine scheduling problem with workforce and contiguity constraints
Caselli, Giulia, (2024)
- More ...
-
Global Migration in the 20th and 21st Centuries: the Unstoppable Force of Demography
Dao, Thu Hien, (2018)
-
Bound-consistent spread constraint : application to load balancing in nurse-to-patient assignments
Schaus, Pierre, (2014)
-
Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach
Derval, Guillaume, (2022)
- More ...