Papers › On Preemption and Learning in Stochastic Scheduling

On Preemption and Learning in Stochastic Scheduling

31 May 2022arXiv:2205.15695archive 2025-07-28

Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet

We study single-machine scheduling of jobs, each belonging to a job type that determines its duration distribution. We start by analyzing the scenario where the type characteristics are known and then move to two learning scenarios where the types are unknown: non-preemptive problems, where each started job must be completed before moving to another job; and preemptive problems, where job execution can be paused in the favor of moving to a different job. In both cases, we design algorithms that achieve sublinear excess cost, compared to the performance with known types, and prove lower bounds for the non-preemptive case. Notably, we demonstrate, both theoretically and through simulations, how preemptive algorithms can greatly outperform non-preemptive ones when the durations of different job types are far from one another, a phenomenon that does not occur when the type durations are known.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 7 code samples harvested from 1 repository linked to this paper: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 7 samples from 1 repository, 7 ran (7 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

hugorichard/ml4a-scheduling officialmentioned in paperBSD-3-ClauseSyntology: 7 samples, 7 ran (0 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

7ran

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from hugorichard/ml4a-scheduling. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

hugorichard/ml4a-scheduling official repository 7 samples, 7 ran (0 instrument-failed) · 0 unverified
ftpp mlforscheduling/utils.py ran fingerprinted BSD-3-Clause (permissive) · 19b3997a48ae4661 · report fixture: signature jobs:ndarray/2/float · returned float64 · level recorded 2026-09-25
rr mlforscheduling/utils.py ran fingerprinted BSD-3-Clause (permissive) · d03714c28277ccb1 · report fixture: signature jobs:ndarray/2/float · returned float64 · level recorded 2026-09-25
rr_run mlforscheduling/utils.py ran BSD-3-Clause (permissive) · 1c13e9a5ff9dea64 · report fixture: signature current_time:float/0/float, old_jobs:ndarray/1/float · returned tuple · level recorded 2026-09-25
select_duration mlforscheduling/ucb_rr.py ran BSD-3-Clause (permissive) · ab9914d50bea5947 · report fixture: signature bound:ndarray/1/float, jobs:ndarray/1/int, m:ndarray/1/int, total_time:ndarray/1/float, current_type:int/0/int, n:int/0/int, k:int/0/int · returned float · level recorded 2026-09-25
select_next_job mlforscheduling/ucb_rr.py ran BSD-3-Clause (permissive) · 3b4e33f9f466a5fe · report fixture: signature bound:ndarray/1/float, jobs:ndarray/2/int, m:ndarray/1/int, total_time:ndarray/1/float, n:int/0/int, k:int/0/int · returned tuple · level recorded 2026-09-25
select_next_job mlforscheduling/ucb_u.py ran BSD-3-Clause (permissive) · 7f48f516036fc383 · report fixture: signature bound:ndarray/1/float, jobs:ndarray/2/int, m:ndarray/1/int · returned tuple · level recorded 2026-09-25
update_confidence_bound mlforscheduling/ucb_u.py ran BSD-3-Clause (permissive) · 8f982db6707ee0aa · report fixture: signature bound:ndarray/1/float, m:ndarray/1/int, i:int/0/int, total_time:ndarray/1/float, n:int/0/int, k:int/0/int · returned ndarray · level recorded 2026-09-25

Tasks

Efficient ExplorationScheduling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections