A time predefined variable depth search for nurse rostering
Year of publication: |
2013
|
---|---|
Authors: | Burke, Edmund K. ; Curtois, Timothy ; Qu, Rong ; Vanden Berghe, Greet |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 25.2013, 3, p. 411-419
|
Subject: | timetabling | personnel | local search | heuristics | Pflegeberufe | Nursing profession | Heuristik | Heuristics | Theorie | Theory | Personaleinsatzplanung | Crew scheduling | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
Jafari, Hamed, (2015)
-
Constructing modified variable neighborhood search approaches to solve a nurse scheduling problem
Chen, Ping-Shun, (2024)
-
An integrated algorithm for shift scheduling problems for local public transport companies
Ciancio, Claudio, (2018)
- More ...
-
A Time Predefined Variable Depth Search for Nurse Rostering
Burke, Edmund K., (2013)
-
A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
Burke, Edmund K., (2008)
-
A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
Burke, Edmund K., (2008)
- More ...