FA-93119 / EV charging session scheduling / Member archive

Depot least-laxity-first charging: equal-laxity tie-break · case 04

Which of two equally urgent vehicles charges depends on list order.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

fleet is [[id, need_units, depart_slot, max_units_per_slot]]. A vehicle is present in slots t < depart_slot. Each slot the site capacity site_units is granted in order of laxity (depart_slot - t - ceil(remaining/max_units)) ascending, ties by id; each vehicle gets min(max, remaining, capacity left). Return [[[id, remaining]] sorted by id, sorted ids with remaining > 0].

Why this case matters

Depot, workplace and public EV chargers schedule sessions against prices, circuit limits and departure deadlines; a wrong decision silently strands a driver or overloads a feeder.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
regression: equal-laxity tie-break	`[[["B0", 2], ["B1", 0], ["B2", 0]], ["B0"]]`	`[[["B0", 1], ["B1", 0], ["B2", 0]], ["B0"]]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.