Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/30472
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Defraeye, M | - |
dc.contributor.author | VAN NIEUWENHUYSE, Inneke | - |
dc.date.accessioned | 2020-02-11T15:00:34Z | - |
dc.date.available | 2020-02-11T15:00:34Z | - |
dc.date.issued | 2016 | - |
dc.date.submitted | 2020-02-05T18:06:05Z | - |
dc.identifier.citation | COMPUTERS & OPERATIONS RESEARCH, 65 , p. 149 -162 | - |
dc.identifier.uri | http://hdl.handle.net/1942/30472 | - |
dc.description.abstract | Many shift scheduling algorithms presume that the staffing levels, required to ensure a target customer service, are known in advance. Determining these staffing requirements is often not straightforward, particularly in systems where the arrival rate fluctuates over the day. We present a branch-and-bound approach to estimate optimal shift schedules in systems with nonstationary stochastic demand and service level constraints. The algorithm is intended for personnel planning in service systems with limited opening hours (such as small call centers, banks, and retail stores). Our computational experiments show that the algorithm is efficient in avoiding regions of the solution space that cannot contain the optimum; moreover, it requires only a limited number of evaluations to encounter the estimated optimum. The quality of the starting solution is not a decisive factor for the algorithm's performance. Finally, by benchmarking our algorithm against two state-of-the-art algorithms, we show that our algorithm is very competitive, as it succeeds in finding a high-quality solution fast (i.e., with a limited number of simulations required in the search phase). (C) 2015 Elsevier Ltd. All rights reserved. | - |
dc.description.sponsorship | This research was supported by the Research Foundation-Flanders (FWO) (grant no G.0547.09) | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.rights | 2015 Elsevier Ltd. All rights reserved | - |
dc.subject.other | Time-varying arrival process | - |
dc.subject.other | Staffing and scheduling | - |
dc.subject.other | Personnel planning | - |
dc.subject.other | Capacity analysis | - |
dc.subject.other | Optimization | - |
dc.title | A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 162 | - |
dc.identifier.spage | 149 | - |
dc.identifier.volume | 65 | - |
local.bibliographicCitation.jcat | A1 | - |
local.publisher.place | THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.source.type | Article | - |
dc.identifier.doi | 10.1016/j.cor.2015.06.016 | - |
dc.identifier.isi | WOS:000364272000014 | - |
dc.identifier.eissn | - | |
local.provider.type | Web of Science | - |
local.uhasselt.uhpub | no | - |
item.fulltext | With Fulltext | - |
item.accessRights | Restricted Access | - |
item.fullcitation | Defraeye, M & VAN NIEUWENHUYSE, Inneke (2016) A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand. In: COMPUTERS & OPERATIONS RESEARCH, 65 , p. 149 -162. | - |
item.contributor | Defraeye, M | - |
item.contributor | VAN NIEUWENHUYSE, Inneke | - |
crisitem.journal.issn | 0305-0548 | - |
crisitem.journal.eissn | 1873-765X | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
COR_2016_publication.pdf Restricted Access | Published version | 983.6 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
7
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
12
checked on Sep 12, 2024
Page view(s)
28
checked on Sep 7, 2022
Download(s)
4
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.