Pith. sign in

REVIEW 4 major objections 7 minor 27 references

Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling

T0 review · 4 major / 7 minor · reviewed 2026-07-30 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read An outcome-fair Whittle index raises long-run completion rates for disadvantaged job classes in deadline scheduling, at a profit cost that shrinks as server capacity grows.

desk verdict Useful engineering combo of deadline Whittle and outcome virtual queues; the “guarantee” language outruns the proof, but the sims and trade-off story are real and worth a referee. read the letter →

arxiv 2607.23772 v1 pith:TGZUGA22 submitted 2026-07-26 eess.SY cs.AIcs.SY

Shakti Sharma , Rahul Meshram This is my paper · ORCID
classification eess.SYcs.AIcs.SY
keywords restlessmulti-armedbanditsWhittleindexstochasticdeadlineschedulingoutcomefairnessvirtualqueuesdemographicEVcharging
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Standard Whittle-index scheduling for stochastic deadline jobs maximizes discounted reward but systematically starves demographic classes whose jobs have heavier workloads or tighter deadlines. This paper formulates outcome fairness—minimum long-run completion-rate targets per class—inside the restless bandit model and builds an outcome-fair Whittle index by adding a fairness-deficit virtual-queue term only to feasible jobs. Simulations against plain Whittle and input-fair (quota) Whittle show higher completion rates for the disadvantaged class and a fairness–profit trade-off that narrows once more servers are available. A sympathetic reader cares because the same capacity-constrained deadline setting appears in EV charging, cloud jobs, and real-time wireless, where pure reward maximization can lock out whole user groups.

What carries the argument

The outcome-fair Whittle index ν_fair_i[t] = ν_i(B_i[t], T_i[t], c[t]) + λ_{k_i}[t] δ_i[t], where λ_k is a virtual queue that grows when class k’s completions fall short of its target rate η_k and δ_i marks remaining feasibility; the M highest-index arms are activated each slot.

What would settle it

Re-run the paper’s two-class simulations (N=50 or 80, stated workload/deadline distributions, η_B=0.5, varying M): if the disadvantaged class’s empirical completion rate under the outcome-fair index stays below target while input-fair or plain Whittle matches or exceeds it, or if the profit gap versus plain Whittle does not fall toward zero as M grows, the central claim fails.

Watch

Extended reading notes

Core claim

Grafting a Lyapunov fairness-deficit virtual queue onto the ordinary Whittle index yields an outcome-fair index policy that, in the paper’s two-class deadline simulations, meets prescribed long-run completion-rate targets for the structurally disadvantaged class better than either unconstrained Whittle or fixed per-class server quotas, while the associated profit loss relative to unconstrained Whittle decreases as the number of servers increases.

Load-bearing premise

That simply adding the virtual-queue bonus to the known constant-cost Whittle index, and citing an existing Lyapunov drift result, is enough to guarantee the long-run completion-rate targets without a fresh proof that the coupled fair policy remains indexable or feasible.

Editorial extensions

If this is right

  • Deadline schedulers can enforce designer-chosen completion-rate floors per demographic class by a simple additive virtual-queue priority.
  • Input fairness (fixed server shares) does not guarantee outcome fairness when classes differ in workload and laxity.
  • The profit penalty of fairness is largest at tight capacity and becomes negligible once servers are plentiful.
  • The same virtual-queue-augmented index applies to any indexable deadline RMAB whose baseline index is already computable.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If arrivals or costs become non-stationary, the fixed step-size α in the virtual queue may need online tuning or a diminishing schedule to keep completion rates on target.
  • The method should transfer to multi-class AoI or timely-throughput bandits where “completion” is replaced by a freshness or delivery-debt metric.
  • Closed-form indexability of the fair subsidized MDP remains open; a counter-example with heavy-tailed deadlines would force a fully numerical or rollout fair policy.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 7 minor

Summary. The paper studies a stochastic deadline scheduling problem (motivated by EV charging) modeled as a restless multi-armed bandit with two demographic classes. Building on the closed-form constant-cost Whittle index of Wang et al. [6], the authors define outcome fairness as a long-run per-class completion-rate target (Def. 4, Eq. (9)) and propose an "outcome-fair Whittle index" (Def. 6, Eq. (11)) that adds to the baseline index a class-dependent fairness-deficit virtual queue λ_k[t] (Eq. (10)) multiplied by a feasibility indicator δ_i[t]. Simulations with two classes and varying server capacity M (§V, Figs. 2–3) show the proposed policy raises the disadvantaged class's completion rate relative to standard and input-fair Whittle policies, at a profit cost that shrinks as M grows. Lemmas 1–3 and the indexability claim are stated without proof, with citations to [6], [15], [18].

Significance. If the construction is sound, the paper makes a useful and modestly novel contribution: combining RMAB deadline scheduling with hard outcome-fairness (completion-rate) guarantees via an O(N log N) index policy is, to my knowledge, not in the literature, and the simulation evidence that a simple additive virtual-queue correction can lift a structurally disadvantaged class's completion rate is of practical interest for EV charging and similar systems. The baseline closed-form index is inherited from [6], which keeps the proposal cheap to implement, and the fairness–profit trade-off curves as a function of capacity M are a genuinely informative empirical observation. However, the paper's strengths are currently empirical rather than established: the claimed guarantee "dynamically enforces long-term completion rate guarantees" (Abstract) is asserted, not proved, and the simulations are too thin (two setups, no error bars) to carry the claim alone.

major comments (4)
  1. [§IV, Eq. (10)–(11); claim in Abstract and §IV] The central claim — that the virtual queue (10) 'dynamically enforces long-term completion rate guaranties' (Abstract) — is supported only by the sentence 'The sufficient conditions ... is analyzed using the Lyapunov drift criteria, see [15, Theorem 2]' (§IV). This citation does not obviously transfer. The Hou–Kumar-style drift argument that would yield (9) via mean-rate stability of λ_k requires the greedy rule to maximize, each slot, a weighted sum whose per-slot increments directly reduce the corresponding debt. Here the greedy rule maximizes Σ_i a_i(ν_i + λ_{k_i}δ_i), where δ_i = 1{B_i ≤ T_i} is a feasibility indicator, not a completion credit; and the queue (10) drains only on completions C_k[t]. With workloads B up to 13–15 (§V), service and completion are separated by many slots, so no per-slot drift inequality of the cited form holds. The paper needs either (a) a proof (e.g., a f
  2. [§III, Def. 4 / Eq. (9); §IV; §V parameter choice η_B = 0.5] No feasibility condition on the targets {η_k} is stated or checked. If η_B exceeds the capacity-feasible completion rate for the tight-deadline class (B ~ U(6,13), T = B + U(1,5), 30% of arrivals, M as low as 5 with N = 50), then λ_B[t] grows linearly and the policy degenerates toward serving only class B. The simulations use η_B = 0.5 (§V) without verifying it is inside the feasible region, and Definition 4 / Eq. (9) is silent on feasibility. At minimum the paper should state the feasibility requirement (in the spirit of [14]'s feasibility-region characterization) and verify it for the chosen parameters; ideally, comment on policy behavior when targets are infeasible.
  3. [§IV, Def. 6; §II-E, Lemma 3] The 'outcome-fair Whittle index' (11) is never shown to be the Whittle index of any well-posed subsidized MDP, and the indexability analysis (Lemma 3, §II-E) applies only to the baseline arm without the λ term. Since λ_{k_i}[t] is time-varying and coupled across arms through the shared queue update, the composite policy is not a Whittle index policy in the technical sense. This may be fine — the policy can stand as a virtual-queue-augmented index heuristic — but the paper should say so explicitly (as it commendably does for the appendix heuristic W in §A-4) rather than calling (11) a Whittle index and citing skipped indexability proofs as support.
  4. [§V, Figs. 2–3; Appendix §A-5] The empirical support for the central comparative claim is thin: two experimental setups, 5000 slots each, with no error bars, confidence intervals, seed counts, or sensitivity to the step size α = 5×10⁻⁵. The fairness–profit trade-off (Fig. 3b) and the claim that the gap 'decreases as the server capacity increases' (Abstract) rest on single traces. Moreover, Example 2's baseline is the admittedly 'Whittle-inspired heuristic' fW (Appendix, §A-4), not an exact Whittle index, so the profit-loss attribution in Fig. 3b is relative to a heuristic baseline whose suboptimality gap is unknown. At least 10–20 seeds with reported variability, and a brief sensitivity study in α, are needed before the trade-off claim can be stated quantitatively.
minor comments (7)
  1. [§II-D, Lemma 1] Lemma 1 lists 'Q^ν_i(s,0), Q^ν_i(s,0), and V^ν_i(s)' — the second entry should be Q^ν_i(s,1).
  2. [§III Def. 4 vs. §IV Eq. (10)] Notation collision: A_k[t] and C_k[t] denote cumulative counts in Definition 4 but per-slot counts in Eq. (10). Use distinct symbols (e.g., a_k[t], c_k[t] for per-slot increments).
  3. [§II-D,E] The skipped proofs of Lemmas 1–3 are justified 'due to space constraint,' yet the manuscript includes a full appendix on Example 2. Given that these lemmas underpin the indexability claim, a short proof or a precise pointer (theorem numbers, not just '[18, Appendix B]') would fit the available space.
  4. [References] References [15] and [22] are the same Hou–Kumar INFOCOM paper listed twice with different years (2010 and 2014); please deduplicate and correct. Reference [20] (2026) and [4]–[5] years should be double-checked.
  5. [§II-C and passim] Repeated sentence in §II-C: 'Let S̃_i[t] = (S_i[t], c[t]) denote the extended state of arm i' appears twice; also 'R^{a_i}(S̃) == 0' has a double equals sign. Numerous grammar issues throughout ('guaranties', 'is defines the Whittle indexability', 'compare to other schemes'). A careful proofreading pass is needed.
  6. [Figs. 1–3] Figures 1–3: legends, axis labels, and line-style assignments are described only in text ('solid lines for class A and dotted lines for class B'); please add proper legends and state units. Fig. 1's caption should state what the y-axis measures.
  7. [§II-E, index formula] In the baseline index formula (§II-E), for the case T ≤ B the term β^{T−1}[F(B−T+1) − F(B−T)] is positive for increasing F, giving infeasible jobs a higher index than feasible ones; a one-line remark on why this is the correct subsidy-derived priority (penalty avoidance) would help readers, and clarify whether δ_i in (11) is redundant given this term.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: fair index is an additive construction on external Whittle and delivery-debt ingredients, validated by simulation rather than by self-defining the claimed completion rates.

full rationale

The paper’s load-bearing chain does not reduce outputs to inputs by construction. The baseline constant-cost Whittle index and indexability are taken from Wang et al. [6] (external); Lemmas 1–3 are stated as analogous to techniques in [18]/6] with proofs omitted for space—this is a soundness/completeness gap, not Eq.X≡Eq.Y circularity. Outcome fairness is enforced by grafting a Hou–Kumar-style fairness-deficit virtual queue (10) onto that index via the additive rule (11); the long-run completion-rate claim (9) is justified by citing [15, Thm. 2], not by defining completion rates in terms of the index or by fitting η_k to the same metrics later reported. Numerical sections compare three policies under explicitly stated generative arrival/workload models and report measured completion rates and profit differences; nothing is fit on a subset and then re-presented as a prediction. Self-citations ([18], [19], [3], [21]) supply proof templates or related RMAB context and are not used as uniqueness theorems that force the fair policy. Whether the Lyapunov citation actually transfers to multi-slot workloads is a correctness risk outside this circularity pass. No self-definitional loop, fitted-input-as-prediction, or renaming of a known empirical law was found.

Assumptions & free parameters 5 free parameters · 7 assumptions · 2 invented entities

The load-bearing claim rests on standard RMAB/Whittle machinery, the Wang et al. deadline model, Hou–Kumar-style virtual-queue feasibility, and designer-chosen fairness targets and step sizes. No new physical entities; the “fairness deficit virtual queue” is an algorithmic bookkeeping device imported from prior scheduling theory. Free parameters (η_k, α, class job distributions, penalties) directly shape the reported fairness–profit curves.

free parameters (5)
  • η_k (target completion rates) = η_B=0.5 in §V Example 1
    Designer-chosen long-run completion-rate targets in Definition 4 and virtual-queue update (10); Example 1 uses η_B=0.5. Central fairness claim is relative to these targets.
  • α (virtual-queue step size) = 5e-5
    Step size in λ_k update (10); controls how aggressively fairness debt boosts priority. Chosen as 5×10^{-5} in simulations, not derived.
  • Class workload/deadline distributions and arrival mix = Class A ~70% easy jobs; Class B ~30% hard jobs (Examples 1–2)
    U(·) ranges, 70/30 arrival split, vacancy arrival probabilities (0.9 / 0.55) define the structural disadvantage that plain Whittle exploits; results are conditional on these generative choices.
  • Penalty/bonus/service-value coefficients (F, G_k, P_k, z_k, v_k) = e.g. F(B)=1.5B; v_A=2.2, v_B=0.9, etc.
    Shape both baseline indices and reported profit; appendix general model uses class-specific v, G, P, waste costs chosen for the experiment.
  • Discount factor β and processing cost c0 = β=0.99, c0=0.2
    Enter the closed-form Whittle index and cumulative reward; fixed at β=0.99, c0=0.2 in sims.
assumptions (7)
  • domain assumption Whittle indexability of each deadline-scheduling arm and validity of the constant-cost closed-form index from Wang et al. 2018
    Lemmas 1–3 and Definition 2–3 rely on [6]; proofs sketched or skipped in §II-D,E.
  • domain assumption Lagrangian relaxation of the instantaneous activation constraint plus subsidy ν yields a useful decoupled single-arm MDP (standard Whittle program)
    §II-D; classical RMAB assumption used without re-derivation.
  • domain assumption Lyapunov drift conditions of Hou–Kumar [15, Thm. 2] apply to the fairness-deficit queues (10) under the additive fair index policy
    Invoked in §IV to claim feasibility/optimality support without checking or restating hypotheses for this policy.
  • domain assumption Jobs in distinct queue positions evolve as independent arms; demographic class k_i is observed and fixed per job
    System model §II; required for RMAB decomposition and per-class virtual queues.
  • ad hoc to paper Outcome fairness is the long-run ratio liminf C_k[T]/A_k[T] ≥ η_k (Definition 4)
    Modeling choice of fairness criterion versus input fairness (8); drives the virtual-queue design.
  • domain assumption Dummy arms with state (0,0) and index 0 may pad the system so exactly M arms are active each slot
    §II-A standard RMAB modeling device.
  • standard math Standard discounted MDP existence results for deterministic stationary policies on the countable/finite state model
    Objective (2) and single-arm value functions (3)–(7).
invented entities (2)
  • Outcome-Fair Whittle Index ν_fair_i[t] = ν_i + λ_{k_i}[t] δ_i[t]
    purpose: Scalar priority that mixes economic Whittle score with accumulated demographic fairness debt, masked by feasibility.
    Named as if it were a Whittle index of a fair RMAB, but constructed by additive grafting rather than solving a subsidized fair single-arm MDP; independent evidence limited to simulations.
  • Fairness deficit virtual queue λ_k[t] independent evidence
    purpose: Track cumulative shortfall η_k A_k - C_k and boost priority of class k.
    Direct import of delivery-debt / virtual-queue bookkeeping from prior deadline scheduling; not a new physical entity. Falsifiable only via whether (9) is met in operation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling." pith.science (2026). https://pith.science/paper/TGZUGA22

@misc{pith2026260723772,
  author       = {Pith},
  title        = {Pith review of: Outcome-Fair Restless Multi-Armed Bandits for Stochastic Deadline Scheduling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TGZUGA22}},
  note         = {Machine review of arXiv:2607.23772}
}
read the original abstract

We study a restless multi-armed bandit (RMAB) problem for a stochastic deadline scheduling application. RMAB problems are solved using the Whittle index policy. The goal in RMAB is to maximize the expected cumulative discounted reward maximization. The Whittle index policy maximizes reward, but is not fair among two classes. In this paper, we introduce fairness criteria and study an outcome-fair model for RMAB which allows fairness for jobs and users structurally disadvantaged demographic classes. We formulate an outcome fair stochastic deadline scheduling problem as RMAB, and we develop the outcome fair Whittle index policy. We define a virtual queue mechanism that dynamically enforces long-term completion rate guaranties across demographic groups. We analyze a standard Whittle index policy and the outcome-fair index policy. We demonstrate the performance of our algorithms with numerical examples. We compare policies---Whittle index policy (no fairness), input-fairness Whittle index policy, outcome fair Whittle index policy. We observe that the outcome-fair Whittle index policy provides better fairness among classes compared to other policies. We demonstrate a trade off between fairness and profit. This decreases as the server capacity increases.

Figures

Figures reproduced from arXiv: 2607.23772 by the authors.

Figure 1
Figure 1. Exp 1: Standard Whittle Inherent Bias. Assuming the [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Completion rates vs Server capacity for a simple two [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Comparison of scheduling policies as the number of [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 2 linked inside Pith

  1. [6]

    Deadline scheduling as restless bandits,

    W. Wang, J. Xu, and L. Tong, “Deadline scheduling as restless bandits,”IEEE Transactions on Automatic Control, vol. 63, no. 8, pp. 2343–2358, 2018

    2018

  2. [15]

    Scheduling heterogeneous real- time traffic over fading wireless channels,

    I-Hong Hou and P. R. Kumar, “Scheduling heterogeneous real- time traffic over fading wireless channels,” inProceedings of IEEE INFOCOM, 2010, pp. 1–9

    2010

  3. [18]

    Indexability of finite state restless multi-armed bandit and rollout policy,

    V . Mittal, R. Meshram, D. Dev, and S. Prakash, “Indexability of finite state restless multi-armed bandit and rollout policy,”arXiv preprint arXiv:2305.00410, 2023

    arXiv 2023

  4. [14]

    A theory of QoS for wireless,

    I-Hong Hou, Vivek Borkar, and P. R. Kumar, “A theory of QoS for wireless,” inProceedings of IEEE INFOCOM, 2009, pp. 486–494

    2009

  5. [1]

    Restless bandits: Activity allocation in a changing world,

    P. Whittle, “Restless bandits: Activity allocation in a changing world,” Journal of Applied Probability, vol. 25, no. A, pp. 287–298, 1988

    1988

  6. [2]

    On an index policy for restless bandits,

    R. R. Weber and G. Weiss, “On an index policy for restless bandits,” Journal of applied probability, vol. 27, no. 3, pp. 637–648, 1990

    1990

  7. [3]

    Rested and restless bandits with constrained arms and hidden states: Applications in social networks and 5g networks,

    V . Mehta, R. Meshram, K. Kaza, S. N. Merchant, and U. B. Desai, “Rested and restless bandits with constrained arms and hidden states: Applications in social networks and 5g networks,”IEEE Access, vol. 6, pp. 56782–56799, 2018

    2018

  8. [4]

    Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals,

    Y . Hsu, E. Modiano, and L. Duan, “Scheduling algorithms for minimizing age of information in wireless broadcast networks with random arrivals,”IEEE Transactions on Mobile Computing, vol. 19, no. 12, pp. 2903–2915, 2019

    2019

Show all 27 references
  1. [5]

    Fresh caching of dynamic contents using restless multi-armed bandits over wireless access,

    A. Koley and C. Singh, “Fresh caching of dynamic contents using restless multi-armed bandits over wireless access,”IEEE Transactions on Networking, 2025

    2025

  2. [7]

    Index policies for real-time multicast scheduling for wireless broadcast systems,

    V . Raghunathan, V . Borkar, M. Cao, and P. R. Kumar, “Index policies for real-time multicast scheduling for wireless broadcast systems,” in Proceedings of IEEE INFOCOM, 2008, pp. 1–9

    2008

  3. [8]

    Scheduling policies for minimizing age of information in broadcast wireless networks,

    I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, “Scheduling policies for minimizing age of information in broadcast wireless networks,”IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637–2650, 2018

    2018

  4. [9]

    Towards soft fairness in restless multi- armed bandits,

    D. Li and P. Varakantham, “Towards soft fairness in restless multi- armed bandits,”arXiv preprint arXiv:2207.13343, 2022

    2022 arXiv

  5. [10]

    Fairness for workers who pull the arms: An index based policy for allocation of restless bandit tasks,

    A. Biswas, J. A. Killian, P. R. Diaz, S. Ghosh, and M. Tambe, “Fairness for workers who pull the arms: An index based policy for allocation of restless bandit tasks,”arXiv preprint arXiv:2303.00799, 2023

    2023

  6. [11]

    Online restless multi-armed bandits with long-term fairness constraints,

    S. Wang, G. Xiong, and J. Li, “Online restless multi-armed bandits with long-term fairness constraints,” inProceedings of the AAAI Conference on Artificial Intelligence, 2024, pp. 15616–15624

    2024

  7. [12]

    Time-constrained restless multi-armed bandits with applications to city service scheduling.,

    Y . Mao and A. Perrault, “Time-constrained restless multi-armed bandits with applications to city service scheduling.,” inAAMAS, 2024, pp. 2375–2377

    2024

  8. [13]

    Fair scheduling with deadline guarantees in single-hop networks,

    K. J. H. Ahmed and S. Bhashyam, “Fair scheduling with deadline guarantees in single-hop networks,” inSixth International Conference on Communication Systems and Networks (COMSNETS), 2014, pp. 1–7

    2014

  9. [16]

    Scheduling multicast traffic with deadlines in wireless networks,

    Kyu S. K., C. Li, and E. Modiano, “Scheduling multicast traffic with deadlines in wireless networks,” inProceedings of IEEE INFOCOM, 2014, pp. 2193–2201

    2014

  10. [17]

    On an information and control architecture for future electric energy systems,

    Le X., Tong H., P. R. Kumar, A. A. Thatte, and S. K. Mitter, “On an information and control architecture for future electric energy systems,”IEEE Transactions on Power Systems, vol. 38, no. 1, pp. 10–31, 2022

    2022

  11. [19]

    Constrained restless bandits for dynamic scheduling in cyber-physical systems,

    K. Kaza, R. Meshram, V . Mehta, and S. N. Merchant, “Constrained restless bandits for dynamic scheduling in cyber-physical systems,” IEEE Access, vol. 12, pp. 182274–182295, 2024

    2024

  12. [20]

    Lagrangian index policy for restless bandits with average reward,

    K. Avrachenkov, V . S. Borkar, and P. Shah, “Lagrangian index policy for restless bandits with average reward,”Queueing Systems, vol. 110, no. 1, pp. 21, 2026

    2026

  13. [21]

    Simulation based algorithms for Markov decision processes and multi-action restless bandits,

    R. Meshram and K. Kaza, “Simulation based algorithms for Markov decision processes and multi-action restless bandits,” Arxiv, 2020

    2020

  14. [22]

    Scheduling heterogeneous real-time traffic over fading wireless channels,

    I-Hong Hou and P. R. Kumar, “Scheduling heterogeneous real-time traffic over fading wireless channels,” inIEEE INFOCOM, 2014. APPENDIX A. Study of Example 2: General Model for Deadline Scheduling At each time step, the scheduler selects at mostMjobs to receive one unit of serv...

    2014

  15. [23]

    Here,F: Z+ →R + is an increasing function satisfyingF(0) = 0

    Deadline Failure Penalty:If the job reaches its final time slot before the deadline, i.e.,T i[t] = 1, an additional penaltyF(B i[t]−a i[t])is imposed whenever unfinished workload remains after the scheduling decision. Here,F: Z+ →R + is an increasing function satisfyingF(0) = ...

  16. [24]

    Since these resources do not produce a completed job, the scheduler incurs the additional penalty r(i) waste =−z ki Ei[t]

    Wasted Service Penalty:Suppose an unfinished job has already receivedE i[t]units of service before missing its deadline. Since these resources do not produce a completed job, the scheduler incurs the additional penalty r(i) waste =−z ki Ei[t]. The total wasted-service penalty ...

  17. [25]

    The scheduler then selects theMjobs with the largest values

    Scheduling Policy:At every decision epoch, the heuris- tic index is computed for every job in the queue. The scheduler then selects theMjobs with the largest values. A(t) = arg max |S|=M X j∈S fWj(B, T), This policy preserves the computational efficiency of Whittle-index sched...

  18. [26]

    Discussion:The proposed score should be viewed as a Whittle-inspired heuristicrather than an exact Whittle index. An exact Whittle index would require solving the single-job subsidized dynamic programming problem and determining the subsidy for which the active and passive act...

  19. [27]

    There are two classes are considered

    Details on Simulation:In this example, we demon- strate with this general reward, the completion rate vs number of servers capacity. There are two classes are considered. The outcome fair algorithm improves the completion rate for classBcompared to a heuristic Whittle index po...

Pith tools

Reviewed July 30, 2026 · model on record in the stance chip above.