Learning to enumerate shifts for large-scale flexible personnel scheduling problems

Farin Rastgar-Amini (), Claudio Contardo (), Guy Desaulniers () and Maxime Gasse ()
Additional contact information
Farin Rastgar-Amini: Polytechnique Montréal
Claudio Contardo: GERAD
Guy Desaulniers: Polytechnique Montréal
Maxime Gasse: Polytechnique Montréal

Journal of Scheduling, 2025, vol. 28, issue 4, No 4, 425-443

Abstract: Abstract Personnel scheduling consists of determining employee work schedules (sequences of work shifts and days off) to cover the demand for multiple jobs over a planning horizon. We consider finding a near-optimal set of personnel schedules via the solution of a generalized set-covering model with side constraints in a flexible context where a large number of potential shifts can be considered as in the retail industry. Commercial solvers applied to this model often require very long computational times for practical problem sizes and as such rely on enumeration heuristics for filtering non-promising shifts/schedules and, thus, reducing the problem size. We propose deep learning-based heuristics to drive the enumeration of promising potential shifts based on the information collected from previously solved instances. Our models predict a subset of time points at which promising shifts are more likely to either start or end, thus filtering out those that do not start nor end at those time points. Our computational results on real-life instances show that personnel scheduling problems can be solved considerably faster with an acceptable optimality gap if shifts are enumerated according to the time points predicted by our models.

Keywords: Personnel scheduling; Work shifts; Set-covering model; Machine learning; Heuristic shift enumeration (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-025-00844-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:28:y:2025:i:4:d:10.1007_s10951-025-00844-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-025-00844-1

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().