An Automated Employee Timetabling System for Small Businesses
Open accessAbstract
Employee scheduling is one of the most difficult challenges facing any small business owner. The problem becomes more complex when employees with different levels of seniority indicate preferences for specific roles in certain shifts and request flexible work hours outside of the standard eight-hour block. Many business owners and managers, who cannot afford (or choose not to use) commercially-available timetabling apps, spend numerous hours creating sub-optimal schedules by hand, leading to low staff morale. In this paper, we explain how two undergraduate students generalized the Nurse Scheduling Problem to take into account multiple roles and flexible work hours, and implemented a user-friendly automated timetabler based on a four-dimensional integer linear program. This system has been successfully deployed at two businesses in our community, each with 20+ employees: a coffee shop and a health clinic.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Both labor needs and supply in algorithmic scheduling rely on algorithmic estimation.
“Both needs and supply rely on algorithmic estimation, with the precise prediction of needs in workforce based on information such as expected or real-time customer traffic, deadlines, real-time monitoring of fluctuating demand, weather forecasts, or on previous occupancy at the same date (Cheng, Rao, Jiang, & Zhou, 2015;Hoshino, Slobodin, & Bernoudy, 2018).”
From Algorithms as work designers: How algorithmic management influences the design of jobs (2022) · cites this paper as Hoshino, Slobodin, & Bernoudy, 2018
The Mathematical Model (p. 3) uses employee availability and minimum and maximum staffing requirements as inputs to an algorithm that optimizes schedules. The Next Steps section (p. 6) says managers gather employee preferences and enter them into the program. The paper therefore supports algorithmic scheduling using information about needs and supply, but not the claim that the algorithm estimates both. (LLM, conf=0.79)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Staff scheduling and rostering: A review of applications, methods and models
Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00095-x · Cited by 1,264 · see citing works
Nurse rostering problems––a bibliographic survey
Cheang, B., Li, H., Lim, A. E. B., & Rodrigues, B. (2003) · European Journal of Operational Research · doi:10.1016/s0377-2217(03)00021-3 · Cited by 499 · see citing works
Burke, E. K., Li, J., & Qu, R. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.07.036 · Cited by 185 · see citing works
A genetic algorithm approach to a nurse rerostering problem
Moz, M., & Pato, M. V. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.03.019 · Cited by 141 · see citing works
A scatter search methodology for the nurse rostering problem
Burke, E. K., Curtois, T., Qu, R., & Berghe, G. V. (2009) · Journal of the Operational Research Society · doi:10.1057/jors.2009.118 · Cited by 98 · see citing works
Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction
Wright, P. D., & Mahar, S. (2012) · Omega · doi:10.1016/j.omega.2012.08.004 · Cited by 95 · see citing works
The Preferential Bidding System at Air Canada
Gamache, M., Soumis, F., Villeneuve, D. L., Desrosiers, J., & Gélinas, É. (1998) · Transportation Science · doi:10.1287/trsc.32.3.246 · Cited by 85 · see citing works
NURSE SCHEDULING USING INTEGER LINEAR PROGRAMMING AND CONSTRAINT PROGRAMMING
Trilling, L., Guinet, A., & Magny, D. L. (2006) · IFAC Proceedings Volumes · doi:10.3182/20060517-3-fr-2903.00340 · Cited by 71 · see citing works
Strategic Behavior when Allocating Indivisible Goods Sequentially
Kalinowski, T., Narodytska, N., Walsh, T., & Xia, L. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8697 · Cited by 47 · see citing works
The Quest Draft: an Automated Course Allocation Algorithm
Hoshino, R., & Raible-Clark, C. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i2.19025 · Cited by 4 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Algorithms as work designers: How algorithmic management influences the design of jobs
Parent-Rocheleau, X., & Parker, S. K. (2022) · Human Resource Management Review · doi:10.1016/j.hrmr.2021.100838 · Cited by 512 · see citing works
Designing fair AI for managing employees in organizations: a review, critique, and design agenda
Robert, L. P., Pierce, C., Marquis, L., Kim, S., & Alahmad, R. (2020) · Human–Computer Interaction · doi:10.1080/07370024.2020.1735391 · Cited by 268 · see citing works
An Analysis of the Challenges to Human Resource in Implementing Artificial Intelligence
Vishwakarma, L. P., & Singh, R. K. (2023) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-80455-662-720230006 · Cited by 25 · see citing works
- Authors
- Hoshino, R., Slobodin, A., & Bernoudy, W.
- Affiliations
- Quest University Canada (CA)
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2018-04-27
- Volume
- 32
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2805910173
- Cited by
- 4
- References
- 10
- Citations by year
- 2023: 1 · 2021: 1 · 2020: 2
- FWCI
- 1.11
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Locations
- Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
- AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
- Health Sciences › Health Professions › Emergency Medical Services › Healthcare Operations and Scheduling Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › Constraint Satisfaction and Optimization
- Keywords
- workforce scheduling, small business, nurse scheduling, flexible working hours, multiple roles, seniority, integer linear programming
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review