A graph-based formulation for the shift rostering problem
Year of publication: |
2020
|
---|---|
Authors: | Lai, David ; Leung, Janny M. Y. ; Dullaert, Wout ; Marques, Inês |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 284.2020, 1 (1.7.), p. 285-300
|
Subject: | Human resource planning | Network model | Personnel rostering | Scheduling | Shift rostering | Scheduling-Verfahren | Scheduling problem | Personaleinsatzplanung | Crew scheduling | Theorie | Theory | Personalmanagement | Human Resource Management |
-
Multisite and multishift personnel planning with set-up costs
Nearchou, A. C., (2020)
-
A general branch-and-cut framework for rotating workforce scheduling
Becker, Tristan, (2022)
-
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem
Smet, Pieter, (2016)
- More ...
-
A simulation-optimization approach for a service-constrained multi-echelon distribution network
Noordhoek, Marije, (2018)
-
Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows
Hoogeboom, Maaike, (2020)
-
Solving a manpower scheduling problem for airline catering using metaheuristics
Ho, Sin C., (2010)
- More ...