Polynomially solvable personnel rostering problems
| Year of publication: |
2016
|
|---|---|
| Authors: | Smet, Pieter ; Brucker, Peter ; De Causmaecker, Patrick ; Vanden Berghe, Greet |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 249.2016, 1 (16.2.), p. 67-75
|
| Subject: | Personnel rostering | Polynomial time algorithms | Assignment | Networks | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Personaleinsatzplanung | Crew scheduling | Algorithmus | Algorithm | Personalmanagement | Human Resource Management |
-
Local and global constraint consistency in personnel rostering
Smet, Pieter, (2017)
-
Brusco, Michael J., (2015)
-
Quantifying and enforcing robustness in staff rostering
Wickert, Toni I., (2021)
- More ...
-
Modelling and evaluation issues in nurse rostering
Smet, Pieter, (2014)
-
A learning-based optimization approach to multi-project scheduling
Wauters, Tony, (2015)
-
A Combinatorial Benders' decomposition for the lock scheduling problem
Verstichel, J., (2015)
- More ...