pith. sign in

arxiv: 2406.19053 · v2 · submitted 2024-06-27 · 💻 cs.DM

Staff Scheduling for Demand-Responsive Services

Debsankha Manik , Rico Raber This is my paper

Pith reviewed 2026-05-24 00:14 UTC · model grok-4.3

classification 💻 cs.DM
keywords staff schedulingdemand-responsive servicesoptimization modelride-poolingreward maximizationpersonnel hoursmonotonic reward function
0
0 comments X

The pith

Staff scheduling for demand-responsive services can be modeled by directly optimizing total reward from varying active shifts under a global personnel-hours limit.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that staff scheduling for services like ride-pooling differs from traditional cases because there are no hard minimum staffing requirements at fixed times. Instead the number of active shifts should rise and fall with demand, and the sole binding constraint is the total personnel hours available across the planning horizon. The objective becomes maximizing the sum of instantaneous rewards, where reward at each time grows monotonically with the number of active shifts. Traditional algorithms built around rigid minimum constraints therefore do not apply, so a new modeling approach is needed that optimizes the relevant reward function directly. If the model works, planners can generate schedules that trade off understaffing losses against overstaffing waste without imposing artificial fixed minima.

Core claim

Staff scheduling for demand-responsive services differs in a key way from standard problems: there are often no hard constraints on the minimum number of employees needed at fixed points in time. Rather, the number of employees working at different points in time should vary according to the demand at those points in time. Having too few employees at a point in time results in lost revenue, while having too many results in not having enough at other points, since total personnel-hours are limited. The objective is to maximize the total reward generated over a planning horizon, given a monotonic relationship between the number of shifts active at a point in time and the instantaneous reward.

What carries the argument

An optimization model that maximizes the sum of instantaneous rewards, each determined monotonically by the number of active shifts at that time, subject only to the global total of personnel-hours.

If this is right

  • Schedules adjust the number of active shifts at each time to the instantaneous demand without violating the total personnel-hours budget.
  • The model avoids the need to specify multiple hard role-specific minimums at predetermined times.
  • Lost revenue from understaffing and wasted hours from overstaffing are traded off directly through the monotonic reward function.
  • Existing staff-scheduling solvers that rely on hard time-point constraints become inapplicable or suboptimal.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same total-hours formulation could be applied to other variable-demand operations such as delivery fleets or call-center staffing.
  • Coupling the model with a demand-forecasting module would allow the reward function itself to be updated in rolling-horizon planning.
  • Empirical validation could compare the generated schedules against actual revenue data collected from an operating ride-pooling service.

Load-bearing premise

That the objective depends only on a monotonic relationship between the number of active shifts at each time and the instantaneous reward, with no hard minimum staffing constraints at fixed times and with total personnel-hours as the binding global limit.

What would settle it

A real-world instance in which enforcing a fixed minimum number of active shifts at even one time point produces a higher total reward than the schedule obtained under the paper's total-hours-only constraint.

Figures

Figures reproduced from arXiv: 2406.19053 by Debsankha Manik, Rico Raber.

Figure 1
Figure 1. Figure 1: The reward rt as a function of supply yt as defined in (8) for dt = 1 and different values of the parameter a. for some a > 0; see [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The demanded rides dt as a function of time t. 7 [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Proof of Part 2 of Lemma 1. The dashed rectangle shows a connected component of the bipartite graph G. P1 can P2 can be swapped, keeping the graph bipartite, because there is no edge between the connected component and the rest of the graph. shifts. In this way, we have reduced the difference in number of shifts between D1 and D2 by 2. We can repeat this process until every driver works exactly s shifts. W… view at source ↗
Figure 4
Figure 4. Figure 4: A solution to the MIP formulation (16) that is close to the shift agnostic optimum. Solved for N = 10, s = 5, δ = 8, β = 8, dmax = 10, a = 2. 6.2 Impact of different shift constraints on the gap be￾tween solution and shift agnostic optimum In this subsection, we analyze the impact of various shift constraints on the quality of the optimum feasible shift plan. Specifically, we investigate the impact of the … view at source ↗
Figure 5
Figure 5. Figure 5: As the number of drivers N increases, the difference between the shift agnostic optimum and the optimal shift plan decreases. (a) The supply curve, for different values of total drivers (coloured dashed lines), as well as the shift agnostic optimum (solid black line). Each supply curve is normalized, i.e., divided by the total working hours sNδ. (b) The relative gap from optimum supply compared to the shif… view at source ↗
Figure 6
Figure 6. Figure 6: As the number of shifts per driver s decreases, the difference between the shift agnostic optimum and the optimal shift plan decreases. 6.2.3 Impact of shift lengths Finally, if the total working time sNδ and the number of shifts per driver s is fixed but both the shift length δ and the number of drivers N are flexible, then it is beneficial to choose more drivers with shorter shifts. In this way, we have … view at source ↗
Figure 7
Figure 7. Figure 7: As the shift length δ decreases, the difference between the shift agnostic optimum and the optimal shift plan decreases. 18 [PITH_FULL_IMAGE:figures/full_fig_p018_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Our shift planning method achieves higher total reward than ap [PITH_FULL_IMAGE:figures/full_fig_p019_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Staff scheduling approaches with demand modelling for both service [PITH_FULL_IMAGE:figures/full_fig_p020_9.png] view at source ↗
read the original abstract

Staff scheduling is a well-known problem in operations research and finds its application at hospitals, airports, supermarkets, and many others. Its goal is to assign shifts to staff members such that a certain objective function, e.g. revenue, is maximized. Meanwhile, various constraints of the staff members and the organization need to be satisfied. Typically in staff scheduling problems, there are hard constraints on the minimum number of employees that should be available at specific points of time. Often multiple hard constraints guaranteeing the availability of specific number of employees with different roles need to be considered. Staff scheduling for demand-responsive services, such as, e.g., ride-pooling and ride-hailing services, differs in a key way from this: There are often no hard constraints on the minimum number of employees needed at fixed points in time. Rather, the number of employees working at different points in time should vary according to the demand at those points in time. Having too few employees at a point in time results in lost revenue, while having too many employees at a point in time results in not having enough employees at other points in time, since the total personnel-hours are limited. The objective is to maximize the total reward generated over a planning horizon, given a monotonic relationship between the number of shifts active at a point in time and the instantaneous reward generated at that point in time. This key difference makes it difficult to use existing staff scheduling algorithms for planning shifts in demand-responsive services. In this article, we present a novel approach for modelling and solving staff scheduling problems for demand-responsive services that optimizes for the relevant reward function.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper distinguishes traditional staff scheduling (with hard minimum staffing constraints at fixed times) from demand-responsive services (e.g., ride-pooling), where there are no such hard minima; instead, the number of active shifts at each time affects instantaneous reward via a monotonic mapping, and the sole global constraint is total personnel-hours. It claims to present a novel modeling and solving approach that directly optimizes the relevant reward function.

Significance. If a sound and effective approach were developed, the modeling distinction could enable more appropriate optimization for variable-demand services by avoiding artificial hard constraints and focusing on the reward function, with potential applications in ride-hailing and similar domains.

major comments (1)
  1. [Abstract] Abstract: The manuscript articulates the problem distinction and claims a novel approach for modeling and solving these problems, but supplies no derivation, algorithm description, mathematical formulation, data, or validation. This absence makes it impossible to assess whether any proposed method supports the stated claim or is internally consistent with the modeling assumptions.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their review and for identifying the core limitation in the current manuscript. We agree that the distinction between traditional and demand-responsive staff scheduling is clearly stated, but the absence of technical content prevents evaluation of the claimed novelty.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The manuscript articulates the problem distinction and claims a novel approach for modeling and solving these problems, but supplies no derivation, algorithm description, mathematical formulation, data, or validation. This absence makes it impossible to assess whether any proposed method supports the stated claim or is internally consistent with the modeling assumptions.

    Authors: We agree that the manuscript, as presented, consists only of the problem statement and high-level claim without any derivation, algorithm description, mathematical formulation, data, or validation. This is a valid and substantive criticism. In the revised version we will add (1) a formal mathematical model of the reward function and total personnel-hours constraint, (2) a complete description of the proposed modeling and solution approach with derivation, (3) the algorithm pseudocode or complexity analysis, and (4) computational results on realistic demand-responsive service instances. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The abstract describes a modeling distinction (no hard fixed-time minima, monotonic active-shifts-to-reward mapping, total personnel-hours as sole global limit) without any equations, derivations, fitted parameters, or self-citations. No load-bearing step is shown that reduces by construction to its own inputs. The claim of a novel approach is stated at a high level but does not exhibit any of the enumerated circular patterns; the derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides insufficient technical detail to identify any free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5813 in / 1014 out tokens · 21024 ms · 2026-05-24T00:14:41.676727+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem

    Uwe Aickelin and Kathryn A Dowsland. “Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem”. In: Journal of scheduling 3.3 (2000), pp. 139–153. 21

    work page 2000

  2. [2]

    Survey, categorization, and comparison of recent tour scheduling literature

    Hesham K Alfares. “Survey, categorization, and comparison of recent tour scheduling literature”. In: Annals of Operations Research 127 (2004), pp. 145–175

    work page 2004

  3. [3]

    Scheduling staff using mixed integer programming

    Nicholas Beaumont. “Scheduling staff using mixed integer programming”. In: European journal of operational research 98.3 (1997), pp. 473–484

    work page 1997

  4. [4]

    Implicit modeling of flexible break assignments in optimal shift scheduling

    Stephen E Bechtold and Larry W Jacobs. “Implicit modeling of flexible break assignments in optimal shift scheduling”. In: Management Science 36.11 (1990), pp. 1339–1351

    work page 1990

  5. [5]

    Scheduling work- force and workflow in a high volume factory

    Oded Berman, Richard C Larson, and Edieal Pinker. “Scheduling work- force and workflow in a high volume factory”. In: Management Science 43.2 (1997), pp. 158–172

    work page 1997

  6. [6]

    The SCIP Optimization Suite 8.0

    Ksenia Bestuzheva et al. The SCIP Optimization Suite 8.0 . Technical Re- port. Optimization Online, Dec. 2021. url: http://www.optimization- online.org/DB_HTML/2021/12/8728.html

    work page 2021

  7. [7]

    Convex optimization

    Stephen P Boyd and Lieven Vandenberghe. Convex optimization . Cam- bridge university press, 2004

    work page 2004

  8. [8]

    A simulated annealing approach to the solution of flexible labour scheduling problems

    Michael J Brusco and Larry W Jacobs. “A simulated annealing approach to the solution of flexible labour scheduling problems”. In: Journal of the Operational Research Society 44 (1993), pp. 1191–1200

    work page 1993

  9. [9]

    Starting-time decisions in labor tour scheduling: An experimental analysis and case study

    Michael J Brusco and Larry W Jacobs. “Starting-time decisions in labor tour scheduling: An experimental analysis and case study”. In: European Journal of Operational Research 131.3 (2001), pp. 459–475

    work page 2001

  10. [10]

    Subgraph ejection chains and tabu search for the crew scheduling problem

    Lu´ ıs Cavique, C´ esar Rego, and Isabel Themido. “Subgraph ejection chains and tabu search for the crew scheduling problem”. In: Journal of the Op- erational Research Society 50 (1999), pp. 608–616

    work page 1999

  11. [11]

    A comment on Edie’s “Traffic delays at toll booths

    George B Dantzig. “A comment on Edie’s “Traffic delays at toll booths””. In: Journal of the Operations Research Society of America 2.3 (1954), pp. 339–341

    work page 1954

  12. [12]

    Train crew roster- ing using simulated annealing

    A Ernst, Mohan Krishnamoorthy, and Denis Dowling. “Train crew roster- ing using simulated annealing”. In: Proceedings of ICOTA 98 (1998)

    work page 1998

  13. [13]

    Staff scheduling and rostering: A review of applica- tions, methods and models

    Andreas T Ernst et al. “Staff scheduling and rostering: A review of applica- tions, methods and models”. In: European journal of operational research 153.1 (2004), pp. 3–27

    work page 2004

  14. [14]

    The general employee scheduling problem. An integration of MS and AI

    Fred Glover and Claude McMillan. “The general employee scheduling problem. An integration of MS and AI”. In: Computers & operations re- search 13.5 (1986), pp. 563–573

    work page 1986

  15. [15]

    Improving volunteer scheduling for the Edmonton Folk Festival

    Lynn Gordon and Erhan Erkut. “Improving volunteer scheduling for the Edmonton Folk Festival”. In: Interfaces 34.5 (2004), pp. 367–376

    work page 2004

  16. [16]

    Overlapping start-time bands in implicit tour scheduling

    Larry W Jacobs and Michael J Brusco. “Overlapping start-time bands in implicit tour scheduling”. In: Management Science 42.9 (1996), pp. 1247– 1259. 22

    work page 1996

  17. [17]

    Operator scheduling

    Elbridge Gerry Keith. “Operator scheduling”. In: AIIE Transactions 11.1 (1979), pp. 37–41

    work page 1979

  18. [18]

    Scheduling nurse shifts using goal programming based on nurse preferences: a case study in an emergency department

    M Mohammadian et al. “Scheduling nurse shifts using goal programming based on nurse preferences: a case study in an emergency department”. In: International Journal of Engineering 32.7 (2019), pp. 954–963

    work page 2019

  19. [19]

    Staff scheduling by a genetic algorithm with heuristic operators

    Julio Tanomaru. “Staff scheduling by a genetic algorithm with heuristic operators”. In: 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century . Vol. 3. IEEE. 1995, pp. 1951–1956

    work page 1995

  20. [20]

    Labor scheduling, part 2: Knowing how many on- duty employees to schedule

    Gary M Thompson. “Labor scheduling, part 2: Knowing how many on- duty employees to schedule”. In: Cornell Hotel and Restaurant Adminis- tration Quarterly 39.6 (1998), pp. 26–37

    work page 1998

  21. [21]

    Labor scheduling, part 3: Developing a workforce sched- ule

    Gary M Thopsn. “Labor scheduling, part 3: Developing a workforce sched- ule”. In: Cornell Hotel and Restaurant Administration Quarterly 40.1 (1999), pp. 86–96

    work page 1999

  22. [22]

    Efficient scheduling of part-time employees

    AJ Vakharia, HS Selim, and RR Husted. “Efficient scheduling of part-time employees”. In: Omega 20.2 (1992), pp. 201–213

    work page 1992

  23. [23]

    Equipment scheduling at mail pro- cessing and distribution centers

    Xinhui Zhang and Jonathan F Bard. “Equipment scheduling at mail pro- cessing and distribution centers”. In:IIE Transactions 37.2 (2005), pp. 175– 187. 23

    work page 2005