FA-95149 / Warehouse slotting and bin packing / Member archive

Re-slot plan: smallest savings accepted first · case 04

The move budget is consumed by the least valuable moves.

Member previewVariant 4 · 3 implementations · 8 checks per implementation

Case contract

cands [[sku, from_slot, to_slot, weekly_picks, travel_from, travel_to]]. Weekly benefit = picks*(travel_from - travel_to); keep candidates with benefit >= move_cost; rank by benefit desc, sku, from, to. Greedily accept up to max_moves: each SKU moves once, each target is used once, and a target that is the from_slot of any candidate is occupied unless that slot was already vacated by an accepted move. Return [[sku, to_slot, benefit]].

Why this case matters

Periodic re-slotting moves SKUs whose velocity changed toward better locations.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
generated mix 80	`[["K1", "S6", 800]]`	`[["K1", "S1", 1600]]`	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.