Schedultary

Courier and delivery depot · 17 people

Ruvenna Courier Depot

A courier depot with an early sort crew and delivery drivers on routes Monday to Saturday.

Start with This SetupAll Examples

Start with This Setup signs you up and starts your workplace with this example's shifts, coverage, rules and hours. The fictional people and their schedule stay on this page.

Ruvenna Courier Depot

Interactive demo · Fictional company

Try both sides of Ruvenna Courier Depot, a 17-person courier and delivery depot. Changes stay on this page and reset when you reload. No account needed.

Try Both Sides

You are Esme, the schedule manager.

Published Schedule

This month is visible in Employee View. Choose November 2026 above to build the next month.

Published
Team Members
17
Assigned Shifts
270
Days Short
0
Rule Conflicts
0

October 2026

MonTueWedThuFriSatSun

Thu, Oct 1

  • Nico NorthcottEarly Sort · 04:00 to 09:00
  • Xavi HadleyEarly Sort · 04:00 to 09:00
  • Ilse EastlakeEarly Sort · 04:00 to 09:00
  • Emrys VargaEarly Sort · 04:00 to 09:00
  • Teo IbarraRoutes · 09:00 to 18:00
  • Una NettlefordRoutes · 09:00 to 18:00
  • Otto FarrantRoutes · 09:00 to 18:00
  • Delia WexfordRoutes · 09:00 to 18:00
  • Juno ElleryRoutes · 09:00 to 18:00
  • Calla WhitlockDispatch · 06:00 to 15:00
Why Each Assignment Was Made

These are selection-time snapshots. Later staffing or policy changes require regeneration for a new explanation. Costs rank candidates at that step and are separate from the final fairness score.

Thu, Oct 1 · Calla Whitlock · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Nico Northcott · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Xavi Hadley · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 104.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 166.00.

  1. Exchanged equal-FTE ordinary duties to reduce weekend imbalance while preserving individual shift totals, duty mix, holidays and request satisfaction. Both resulting assignments passed independent schedule validation.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Teo Ibarra · Routes

Stage: initial. 6 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Otto Farrant · Routes

Stage: initial. 4 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Delia Wexford · Routes

Stage: initial. 3 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 1 · Juno Ellery · Routes

Stage: initial. 2 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Elsie Ormond · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 120.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Ilse Eastlake · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Emrys Varga · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Otto Farrant · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 97.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Nico Northcott · Routes

Stage: initial. 7 eligible choices. Selected cost: 6.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Xavi Hadley · Routes

Stage: initial. 6 eligible choices. Selected cost: 6.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Teo Ibarra · Routes

Stage: initial. 5 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Una Nettleford · Routes

Stage: initial. 4 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 2 · Saoirse Vantreese · Routes

Stage: initial. 8 eligible choices. Selected cost: 2.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Esme Fenwick · Dispatch

Stage: initial. 1 eligible choices. Selected cost: 7.33.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 169.00.

  1. Exchanged equal-FTE ordinary duties to reduce weekend imbalance while preserving individual shift totals, duty mix, holidays and request satisfaction. Both resulting assignments passed independent schedule validation.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Calla Whitlock · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 6.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Elsie Ormond · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 6.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Otto Farrant · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 6.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Nico Northcott · Routes

Stage: initial. 4 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Xavi Hadley · Routes

Stage: initial. 3 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Delia Wexford · Routes

Stage: initial. 7 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Juno Ellery · Routes

Stage: initial. 6 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 3 · Saoirse Vantreese · Routes

Stage: initial. 5 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Calla Whitlock · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Imani Merriman · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Ilse Eastlake · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Emrys Varga · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Teo Ibarra · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 10.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Una Nettleford · Routes

Stage: initial. 6 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Otto Farrant · Routes

Stage: initial. 7 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Delia Wexford · Routes

Stage: initial. 5 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Juno Ellery · Routes

Stage: initial. 4 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 5 · Saoirse Vantreese · Routes

Stage: initial. 3 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Calla Whitlock · Dispatch

Stage: target-repair. 1 eligible choices. Selected cost: 116.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 128.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 112.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Elsie Ormond · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Saoirse Vantreese · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 103.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Nico Northcott · Routes

Stage: initial. 8 eligible choices. Selected cost: 22.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Xavi Hadley · Routes

Stage: initial. 7 eligible choices. Selected cost: 22.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Teo Ibarra · Routes

Stage: initial. 6 eligible choices. Selected cost: 22.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Una Nettleford · Routes

Stage: initial. 4 eligible choices. Selected cost: 26.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 6 · Otto Farrant · Routes

Stage: initial. 5 eligible choices. Selected cost: 22.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Elsie Ormond · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Imani Merriman · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Delia Wexford · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Juno Ellery · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Saoirse Vantreese · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 14.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Nico Northcott · Routes

Stage: initial. 5 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Xavi Hadley · Routes

Stage: initial. 4 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Teo Ibarra · Routes

Stage: initial. 3 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Una Nettleford · Routes

Stage: initial. 1 eligible choices. Selected cost: 34.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 7 · Otto Farrant · Routes

Stage: initial. 2 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Elsie Ormond · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 26.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 163.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Ilse Eastlake · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Emrys Varga · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 18.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Calla Whitlock · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 19.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Nico Northcott · Routes

Stage: initial. 4 eligible choices. Selected cost: 39.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Teo Ibarra · Routes

Stage: initial. 3 eligible choices. Selected cost: 41.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Delia Wexford · Routes

Stage: initial. 6 eligible choices. Selected cost: 33.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Juno Ellery · Routes

Stage: initial. 5 eligible choices. Selected cost: 33.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 8 · Saoirse Vantreese · Routes

Stage: initial. 7 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Calla Whitlock · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 26.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Imani Merriman · Early Sort

Stage: initial. 13 eligible choices. Selected cost: 26.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 136.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 96.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Una Nettleford · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 23.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Nico Northcott · Routes

Stage: initial. 2 eligible choices. Selected cost: 49.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Otto Farrant · Routes

Stage: initial. 6 eligible choices. Selected cost: 38.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Delia Wexford · Routes

Stage: initial. 5 eligible choices. Selected cost: 38.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Juno Ellery · Routes

Stage: initial. 4 eligible choices. Selected cost: 38.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 9 · Saoirse Vantreese · Routes

Stage: initial. 3 eligible choices. Selected cost: 41.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Calla Whitlock · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 37.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Xavi Hadley · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 29.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Ilse Eastlake · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 26.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Emrys Varga · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 26.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Teo Ibarra · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Una Nettleford · Routes

Stage: initial. 6 eligible choices. Selected cost: 46.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Otto Farrant · Routes

Stage: initial. 5 eligible choices. Selected cost: 49.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Delia Wexford · Routes

Stage: initial. 4 eligible choices. Selected cost: 51.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Juno Ellery · Routes

Stage: initial. 3 eligible choices. Selected cost: 51.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 10 · Saoirse Vantreese · Routes

Stage: initial. 2 eligible choices. Selected cost: 51.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Esme Fenwick · Dispatch

No matching generation snapshot. This assignment was imported, manually changed, or selected without a recorded trace.

Mon, Oct 12 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 128.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 112.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Elsie Ormond · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 30.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Juno Ellery · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 97.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Nico Northcott · Routes

Stage: initial. 6 eligible choices. Selected cost: 54.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Xavi Hadley · Routes

Stage: initial. 8 eligible choices. Selected cost: 42.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Teo Ibarra · Routes

Stage: initial. 7 eligible choices. Selected cost: 51.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 57.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 12 · Otto Farrant · Routes

Stage: initial. 4 eligible choices. Selected cost: 57.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Elsie Ormond · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 39.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Imani Merriman · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 34.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Ilse Eastlake · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 34.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Calla Whitlock · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 34.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Delia Wexford · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 34.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Nico Northcott · Routes

Stage: initial. 3 eligible choices. Selected cost: 65.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Xavi Hadley · Routes

Stage: initial. 7 eligible choices. Selected cost: 53.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Teo Ibarra · Routes

Stage: initial. 4 eligible choices. Selected cost: 61.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Juno Ellery · Routes

Stage: initial. 6 eligible choices. Selected cost: 54.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 13 · Saoirse Vantreese · Routes

Stage: initial. 5 eligible choices. Selected cost: 54.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Calla Whitlock · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 46.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 109.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Emrys Varga · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 34.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Una Nettleford · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 39.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Otto Farrant · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 39.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Xavi Hadley · Routes

Stage: initial. 5 eligible choices. Selected cost: 61.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Teo Ibarra · Routes

Stage: initial. 2 eligible choices. Selected cost: 69.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Delia Wexford · Routes

Stage: initial. 6 eligible choices. Selected cost: 59.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Juno Ellery · Routes

Stage: initial. 4 eligible choices. Selected cost: 63.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 14 · Saoirse Vantreese · Routes

Stage: initial. 3 eligible choices. Selected cost: 63.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Calla Whitlock · Dispatch

Stage: target-repair. 1 eligible choices. Selected cost: 138.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 131.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Elsie Ormond · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 43.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Juno Ellery · Early Sort

Stage: initial. 13 eligible choices. Selected cost: 44.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Saoirse Vantreese · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 43.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Nico Northcott · Routes

Stage: initial. 2 eligible choices. Selected cost: 74.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Xavi Hadley · Routes

Stage: initial. 6 eligible choices. Selected cost: 67.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 69.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Otto Farrant · Routes

Stage: initial. 4 eligible choices. Selected cost: 69.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 15 · Delia Wexford · Routes

Stage: initial. 3 eligible choices. Selected cost: 72.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Elsie Ormond · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 53.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Nico Northcott · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 104.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Imani Merriman · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 45.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Ilse Eastlake · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 45.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Emrys Varga · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 45.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Xavi Hadley · Routes

Stage: initial. 8 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Teo Ibarra · Routes

Stage: initial. 7 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Otto Farrant · Routes

Stage: initial. 6 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Delia Wexford · Routes

Stage: initial. 5 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 16 · Juno Ellery · Routes

Stage: initial. 4 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Elsie Ormond · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 61.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Nico Northcott · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 49.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Imani Merriman · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 50.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 169.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 161.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Xavi Hadley · Routes

Stage: initial. 4 eligible choices. Selected cost: 90.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Teo Ibarra · Routes

Stage: initial. 5 eligible choices. Selected cost: 85.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Una Nettleford · Routes

Stage: initial. 7 eligible choices. Selected cost: 79.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Otto Farrant · Routes

Stage: initial. 3 eligible choices. Selected cost: 90.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 17 · Saoirse Vantreese · Routes

Stage: initial. 6 eligible choices. Selected cost: 84.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Elsie Ormond · Dispatch

Stage: initial. 1 eligible choices. Selected cost: 67.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 101.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Ilse Eastlake · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 53.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Emrys Varga · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 53.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Calla Whitlock · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 47.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Nico Northcott · Routes

Stage: initial. 8 eligible choices. Selected cost: 85.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Una Nettleford · Routes

Stage: initial. 4 eligible choices. Selected cost: 88.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Delia Wexford · Routes

Stage: initial. 7 eligible choices. Selected cost: 85.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Juno Ellery · Routes

Stage: initial. 6 eligible choices. Selected cost: 85.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 19 · Saoirse Vantreese · Routes

Stage: initial. 5 eligible choices. Selected cost: 85.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Elsie Ormond · Dispatch

Stage: target-repair. 1 eligible choices. Selected cost: 121.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 155.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Calla Whitlock · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 57.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Una Nettleford · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 59.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Otto Farrant · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 59.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Nico Northcott · Routes

Stage: initial. 3 eligible choices. Selected cost: 96.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Xavi Hadley · Routes

Stage: initial. 2 eligible choices. Selected cost: 96.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Delia Wexford · Routes

Stage: initial. 6 eligible choices. Selected cost: 91.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Juno Ellery · Routes

Stage: initial. 5 eligible choices. Selected cost: 93.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 20 · Saoirse Vantreese · Routes

Stage: initial. 4 eligible choices. Selected cost: 93.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Calla Whitlock · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 65.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 136.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Ilse Eastlake · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 58.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 120.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Teo Ibarra · Early Sort

Stage: initial. 13 eligible choices. Selected cost: 60.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Nico Northcott · Routes

Stage: initial. 5 eligible choices. Selected cost: 101.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Una Nettleford · Routes

Stage: initial. 7 eligible choices. Selected cost: 98.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Otto Farrant · Routes

Stage: initial. 6 eligible choices. Selected cost: 98.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Delia Wexford · Routes

Stage: initial. 4 eligible choices. Selected cost: 102.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 21 · Juno Ellery · Routes

Stage: initial. 3 eligible choices. Selected cost: 102.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Calla Whitlock · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 74.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Xavi Hadley · Early Sort

Stage: initial. 13 eligible choices. Selected cost: 66.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Imani Merriman · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 61.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Emrys Varga · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 61.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Delia Wexford · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 101.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Nico Northcott · Routes

Stage: initial. 3 eligible choices. Selected cost: 113.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Teo Ibarra · Routes

Stage: initial. 7 eligible choices. Selected cost: 100.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 108.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Otto Farrant · Routes

Stage: initial. 4 eligible choices. Selected cost: 108.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 22 · Saoirse Vantreese · Routes

Stage: initial. 6 eligible choices. Selected cost: 102.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Calla Whitlock · Dispatch

Stage: initial. 1 eligible choices. Selected cost: 81.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 107.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Delia Wexford · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 68.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Juno Ellery · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 68.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Saoirse Vantreese · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 68.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Nico Northcott · Routes

Stage: initial. 1 eligible choices. Selected cost: 120.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Xavi Hadley · Routes

Stage: initial. 5 eligible choices. Selected cost: 108.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Teo Ibarra · Routes

Stage: initial. 4 eligible choices. Selected cost: 108.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Una Nettleford · Routes

Stage: initial. 3 eligible choices. Selected cost: 114.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 23 · Otto Farrant · Routes

Stage: initial. 2 eligible choices. Selected cost: 116.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Calla Whitlock · Dispatch

Stage: target-repair. 1 eligible choices. Selected cost: 151.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Imani Merriman · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 71.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Ilse Eastlake · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 71.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Emrys Varga · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 71.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Elsie Ormond · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 70.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Xavi Hadley · Routes

Stage: initial. 5 eligible choices. Selected cost: 123.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Teo Ibarra · Routes

Stage: initial. 8 eligible choices. Selected cost: 118.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Delia Wexford · Routes

Stage: initial. 7 eligible choices. Selected cost: 120.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Juno Ellery · Routes

Stage: initial. 6 eligible choices. Selected cost: 120.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 24 · Saoirse Vantreese · Routes

Stage: initial. 4 eligible choices. Selected cost: 125.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Calla Whitlock · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 90.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Nico Northcott · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 76.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 144.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 147.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Elsie Ormond · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 74.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Xavi Hadley · Routes

Stage: initial. 7 eligible choices. Selected cost: 121.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Teo Ibarra · Routes

Stage: initial. 6 eligible choices. Selected cost: 122.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Otto Farrant · Routes

Stage: initial. 5 eligible choices. Selected cost: 124.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Delia Wexford · Routes

Stage: initial. 4 eligible choices. Selected cost: 124.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Mon, Oct 26 · Juno Ellery · Routes

Stage: initial. 3 eligible choices. Selected cost: 124.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Elsie Ormond · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 86.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Xavi Hadley · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 97.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Imani Merriman · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Ilse Eastlake · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Saoirse Vantreese · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 80.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Teo Ibarra · Routes

Stage: initial. 4 eligible choices. Selected cost: 132.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Una Nettleford · Routes

Stage: initial. 7 eligible choices. Selected cost: 122.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Otto Farrant · Routes

Stage: initial. 6 eligible choices. Selected cost: 130.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Delia Wexford · Routes

Stage: initial. 5 eligible choices. Selected cost: 130.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Tue, Oct 27 · Juno Ellery · Routes

Stage: initial. 3 eligible choices. Selected cost: 132.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Elsie Ormond · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 93.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Imani Merriman · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 155.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Ilse Eastlake · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 117.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Emrys Varga · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 77.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Calla Whitlock · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 80.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Nico Northcott · Routes

Stage: initial. 7 eligible choices. Selected cost: 132.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Xavi Hadley · Routes

Stage: initial. 6 eligible choices. Selected cost: 132.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Teo Ibarra · Routes

Stage: initial. 4 eligible choices. Selected cost: 141.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 133.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Wed, Oct 28 · Saoirse Vantreese · Routes

Stage: initial. 8 eligible choices. Selected cost: 126.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Elsie Ormond · Dispatch

Stage: initial. 2 eligible choices. Selected cost: 102.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Imani Merriman · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 88.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Ilse Eastlake · Early Sort

Stage: initial. 17 eligible choices. Selected cost: 85.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Emrys Varga · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 88.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Calla Whitlock · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 103.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Xavi Hadley · Routes

Stage: initial. 7 eligible choices. Selected cost: 139.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 143.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Otto Farrant · Routes

Stage: initial. 4 eligible choices. Selected cost: 143.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Juno Ellery · Routes

Stage: initial. 6 eligible choices. Selected cost: 141.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Thu, Oct 29 · Saoirse Vantreese · Routes

Stage: initial. 8 eligible choices. Selected cost: 137.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Elsie Ormond · Dispatch

Stage: target-repair. 1 eligible choices. Selected cost: 112.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Nico Northcott · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 89.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 150.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Calla Whitlock · Early Sort

Stage: initial. 16 eligible choices. Selected cost: 88.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Delia Wexford · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 91.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Xavi Hadley · Routes

Stage: initial. 3 eligible choices. Selected cost: 151.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Teo Ibarra · Routes

Stage: initial. 2 eligible choices. Selected cost: 151.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 149.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Juno Ellery · Routes

Stage: initial. 4 eligible choices. Selected cost: 149.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Fri, Oct 30 · Saoirse Vantreese · Routes

Stage: initial. 6 eligible choices. Selected cost: 145.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Calla Whitlock · Dispatch

Stage: initial. 3 eligible choices. Selected cost: 110.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Imani Merriman · Early Sort

Stage: initial. 15 eligible choices. Selected cost: 100.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Ilse Eastlake · Early Sort

Stage: initial. 14 eligible choices. Selected cost: 100.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Emrys Varga · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 174.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Elsie Ormond · Early Sort

Stage: target-repair. 1 eligible choices. Selected cost: 111.00.

  1. Moved from a part-time person so a full-time person reaches their target first. Every hard rule still applies.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Nico Northcott · Routes

Stage: initial. 8 eligible choices. Selected cost: 146.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Teo Ibarra · Routes

Stage: initial. 4 eligible choices. Selected cost: 163.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Una Nettleford · Routes

Stage: initial. 5 eligible choices. Selected cost: 160.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Otto Farrant · Routes

Stage: initial. 6 eligible choices. Selected cost: 155.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.
Sat, Oct 31 · Delia Wexford · Routes

Stage: initial. 7 eligible choices. Selected cost: 153.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and call-spacing costs.
  6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.