A Branch-and-Bound Algorithm for Shift Scheduling with Nonstationary Demand
Year of publication: |
2014
|
---|---|
Authors: | Defraeye, Mieke ; Van Nieuwenhuyse, Inneke |
Publisher: |
[S.l.] : SSRN |
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Operations Research | Operations research |
Extent: | 1 Online-Ressource (30 p) |
---|---|
Type of publication: | Book / Working Paper |
Language: | English |
Notes: | Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments December 16, 2013 erstellt |
Other identifiers: | 10.2139/ssrn.2381907 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
-
Zhou, Shuyu, (2013)
- More ...
-
Setting staffing levels in systems with time-varying demand : the context of an emergency department
Defraeye, Mieke, (2011)
-
Controlling excessive waiting times in emergency departments : an extension of the ISA algorithm
Defraeye, Mieke, (2011)
-
Defraeye, Mieke, (2011)
- More ...