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

Tote packing: newest tote tried first · case 05

Items are placed in the most recently opened tote even when an earlier tote had room.

Member previewVariant 5 · 3 implementations · 8 checks per implementation

Case contract

items [[id, volume, kg, fragile]]. Sort by volume desc, kg desc, id. Place each in the first open tote (creation order) where volume and weight stay within limits (inclusive) and no fragile item shares a tote with an item over 10 kg (either direction). Items exceeding a tote alone go to oversize. Return [list of tote id lists, sorted oversize ids].

Why this case matters

Packing picked units into conveyor totes is bounded by volume, weight, and damage rules.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
generated mix 76	`[[["i5"], ["i2"], ["i1", "i3"], ["i7", "i4", "i0"], ["i6"]], []]`	`[[["i5"], ["i2", "i4"], ["i1", "i0", "i3"], ["i7"], ["i6"]], []]`	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.