A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand
| Year of publication: |
2016
|
|---|---|
| Authors: | Defraeye, Mieke ; Van Nieuwenhuyse, Inneke |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 65.2016, p. 139-148
|
| Subject: | Time-varying arrival process | Staffing and scheduling | Personnel planning | Capacity analysis | Optimization | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Stochastischer Prozess | Stochastic process | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Personaleinsatzplanung | Crew scheduling |
-
Staffing and scheduling under nonstationary demand for service : a literature review
Defraeye, Mieke, (2016)
-
Stochastic project management : multiple projects with multi-skilled human resources
Felberbauer, Thomas, (2019)
-
Due-window assignment scheduling problem with stochastic processing times
Yue, Qing, (2021)
- More ...
-
Setting staffing levels in systems with time-varying demand : the context of an emergency department
Defraeye, Mieke, (2011)
-
A Markov Model for Measuring Service Levels in Nonstationary G(t)/G(t)/s(t)+G(t) Queues
Creemers, Stefan, (2013)
-
Setting Staffing Levels in Systems with Time-Varying Demand : The Context of an Emergency Department
Defraeye, Mieke, (2011)
- More ...