FA-67368 / Elevator dispatch scheduling / Member archive

Destination dispatch allocation: coincident stop credit · case 03

Passengers for the same floor are spread over several cars.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Requests (destination, group size) are allocated one by one. A car is eligible if load + group size <= capacity. Cost = ready time + per_stop_s * existing stops + stop_penalty_s if the destination is not already a stop. The lowest cost wins, ties to the lowest car id. The chosen car adds the destination to its stops and the group to its load. None if no car is eligible.

Why this case matters

Lift group controllers make these decisions many times per minute; a wrong answer strands passengers, wastes trips or overrides a safety rule.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
regression: coincident destination beats an idle car	`["A"]`	`["B"]`	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.