Six shifts have different call arrival rates. For each we choose a staffing level; the expected wait grows without bound as the shift approaches full utilisation. Staffing costs money and waits above an SLA target are penalised, so the good plan staffs the busy shifts heavily and the quiet ones lightly rather than uniformly. Score is staffing cost plus SLA penalty, to minimise. 6-D problem.
| Algorithm | Cost | Evals |
|---|---|---|
| — no runs yet — | ||
The JS objective is a line-for-line port of
example_applications/queue_staffing and agrees to floating-point
tolerance. Bars are agents staffed per shift; the dotted overlay is the call arrival
rate. Understaff a busy shift and the wait penalty spikes.