Schedultary

Customer support desk · 13 people

Ondrivo Help Desk

A customer support desk with early and late phone shifts on weekdays and a short Saturday shift.

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.

Ondrivo Help Desk

Interactive demo · Fictional company

Try both sides of Ondrivo Help Desk, a 13-person customer support desk. Changes stay on this page and reset when you reload. No account needed.

Try Both Sides

You are Una, the schedule manager.

Published Schedule

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

Published
Team Members
13
Assigned Shifts
186
Days Short
0
Rule Conflicts
0

October 2026

MonTueWedThuFriSatSun

Thu, Oct 1

  • Hazel NorthcottEarly Phones · 7 AM to 3:30 PM
  • Greer WhitlockEarly Phones · 7 AM to 3:30 PM
  • Uma FarrantEarly Phones · 7 AM to 3:30 PM
  • Saoirse ElleryEarly Phones · 7 AM to 3:30 PM
  • Soren OrmondLate Phones · 10:30 AM to 7 PM
  • Tamsin IbarraLate Phones · 10:30 AM to 7 PM
  • Dario NettlefordLate Phones · 10:30 AM to 7 PM
  • Hollis VantreeseLate Phones · 10:30 AM to 7 PM
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 · Hazel Northcott · Early Phones

Stage: initial. 10 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 · Greer Whitlock · Early Phones

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 · Uma Farrant · Early Phones

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.
Thu, Oct 1 · Saoirse Ellery · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 119.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 · Soren Ormond · Late Phones

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 · Tamsin Ibarra · Late Phones

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 · Dario Nettleford · Late Phones

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 · Hollis Vantreese · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 108.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 · Soren Ormond · Early Phones

Stage: initial. 3 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 · Uma Farrant · Early Phones

Stage: initial. 10 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 · Juno Wexford · Early Phones

Stage: initial. 9 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 · Saoirse Ellery · Early Phones

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.
Fri, Oct 2 · Hazel Northcott · Late Phones

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 · Greer Whitlock · Late Phones

Stage: initial. 2 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 · Dario Nettleford · Late Phones

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 2 · Hollis Vantreese · Late Phones

Stage: initial. 7 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 · Tamsin Ibarra · Saturday Phones

Stage: initial. 3 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 · Dario Nettleford · Saturday Phones

Stage: initial. 11 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.
Mon, Oct 5 · Soren Ormond · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 114.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 5 · Tamsin Ibarra · Early Phones

Stage: initial. 3 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 · Dario Nettleford · Early Phones

Stage: initial. 8 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 · Hollis Vantreese · Early Phones

Stage: initial. 10 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.
Mon, Oct 5 · Greer Whitlock · Late Phones

Stage: initial. 2 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 · Uma Farrant · Late Phones

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.
Mon, Oct 5 · Juno Wexford · Late Phones

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.
Mon, Oct 5 · Saoirse Ellery · Late Phones

Stage: initial. 5 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.
Tue, Oct 6 · Hazel Northcott · Early Phones

Stage: initial. 10 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 · Soren Ormond · Early Phones

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.
Tue, Oct 6 · Uma Farrant · Early Phones

Stage: initial. 8 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 · Hollis Vantreese · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 122.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 · Greer Whitlock · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 108.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 · Tamsin Ibarra · Late Phones

Stage: initial. 2 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 · Juno Wexford · Late Phones

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.
Tue, Oct 6 · Saoirse Ellery · Late Phones

Stage: initial. 6 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 · Greer Whitlock · Early Phones

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 · Dario Nettleford · Early Phones

Stage: initial. 9 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 · Juno Wexford · Early Phones

Stage: initial. 8 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 · Hollis Vantreese · Early Phones

Stage: initial. 10 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 · Hazel Northcott · Late Phones

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.
Wed, Oct 7 · Soren Ormond · Late Phones

Stage: initial. 2 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 · Uma Farrant · Late Phones

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.
Wed, Oct 7 · Saoirse Ellery · Late Phones

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 8 · Quinn Eastlake · Early Phones

Stage: initial. 8 eligible choices. Selected cost: 21.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 · Tamsin Ibarra · Early Phones

Stage: initial. 3 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.
Thu, Oct 8 · Saoirse Ellery · Early Phones

Stage: initial. 9 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 · Hollis Vantreese · Early Phones

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.
Thu, Oct 8 · Greer Whitlock · Late Phones

Stage: initial. 2 eligible choices. Selected cost: 27.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 · Dario Nettleford · Late Phones

Stage: initial. 6 eligible choices. Selected cost: 25.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 · Uma Farrant · Late Phones

Stage: initial. 5 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 · Juno Wexford · Late Phones

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.
Fri, Oct 9 · Soren Ormond · Early Phones

Stage: initial. 3 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.
Fri, Oct 9 · Dario Nettleford · Early Phones

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 · Uma Farrant · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 122.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 · Saoirse Ellery · Early Phones

Stage: initial. 8 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.
Fri, Oct 9 · Emrys Merriman · Late Phones

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

  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 · Greer Whitlock · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 105.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 · Tamsin Ibarra · Late Phones

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.
Fri, Oct 9 · Hollis Vantreese · Late Phones

Stage: initial. 4 eligible choices. Selected cost: 25.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 · Hazel Northcott · Saturday Phones

Stage: initial. 11 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.
Sat, Oct 10 · Greer Whitlock · Saturday Phones

Stage: initial. 3 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.
Mon, Oct 12 · Greer Whitlock · Early Phones

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

Mon, Oct 12 · Pax Hadley · Early Phones

Stage: initial. 9 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 · Soren Ormond · Early Phones

Stage: initial. 3 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.
Mon, Oct 12 · Uma Farrant · Early Phones

Stage: initial. 8 eligible choices. Selected cost: 31.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 · Tamsin Ibarra · Late Phones

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.
Mon, Oct 12 · Dario Nettleford · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 35.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 · Saoirse Ellery · Late Phones

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.
Mon, Oct 12 · Hollis Vantreese · Late Phones

Stage: initial. 7 eligible choices. Selected cost: 31.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 · Greer Whitlock · Early Phones

Stage: initial. 3 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 · Tamsin Ibarra · Early Phones

Stage: initial. 8 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 · Dario Nettleford · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 98.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 13 · Juno Wexford · Early Phones

Stage: initial. 10 eligible choices. Selected cost: 31.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 · Hazel Northcott · Late Phones

Stage: initial. 7 eligible choices. Selected cost: 35.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 · Emrys Merriman · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 38.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.
Tue, Oct 13 · Soren Ormond · Late Phones

Stage: initial. 2 eligible choices. Selected cost: 35.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 · Uma Farrant · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 105.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 · Greer Whitlock · Early Phones

Stage: initial. 3 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.
Wed, Oct 14 · Uma Farrant · Early Phones

Stage: initial. 9 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 · Juno Wexford · Early Phones

Stage: initial. 8 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.
Wed, Oct 14 · Saoirse Ellery · Early Phones

Stage: initial. 10 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.
Wed, Oct 14 · Soren Ormond · Late Phones

Stage: initial. 2 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.
Wed, Oct 14 · Tamsin Ibarra · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 106.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 · Dario Nettleford · Late Phones

Stage: initial. 5 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.
Wed, Oct 14 · Hollis Vantreese · Late Phones

Stage: initial. 7 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 15 · Hazel Northcott · Early Phones

Stage: initial. 9 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.
Thu, Oct 15 · Soren Ormond · Early Phones

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.
Thu, Oct 15 · Tamsin Ibarra · Early Phones

Stage: initial. 3 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.
Thu, Oct 15 · Hollis Vantreese · Early Phones

Stage: initial. 8 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.
Thu, Oct 15 · Pax Hadley · Late Phones

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

  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 · Greer Whitlock · Late Phones

Stage: initial. 2 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.
Thu, Oct 15 · Juno Wexford · Late Phones

Stage: initial. 5 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.
Thu, Oct 15 · Saoirse Ellery · Late Phones

Stage: initial. 6 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.
Fri, Oct 16 · Hazel Northcott · Early Phones

Stage: initial. 8 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.
Fri, Oct 16 · Greer Whitlock · Early Phones

Stage: initial. 3 eligible choices. Selected cost: 55.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 · Dario Nettleford · Early Phones

Stage: initial. 10 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 16 · Uma Farrant · Early Phones

Stage: initial. 9 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 16 · Soren Ormond · Late Phones

Stage: initial. 2 eligible choices. Selected cost: 52.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 Wexford · Late Phones

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.
Fri, Oct 16 · Saoirse Ellery · Late Phones

Stage: initial. 6 eligible choices. Selected cost: 52.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 · Hollis Vantreese · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 56.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 · Soren Ormond · Saturday Phones

Stage: initial. 3 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.
Sat, Oct 17 · Saoirse Ellery · Saturday Phones

Stage: target-repair. 1 eligible choices. Selected cost: 66.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 · Tamsin Ibarra · Early Phones

Stage: initial. 3 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.
Mon, Oct 19 · Juno Wexford · Early Phones

Stage: initial. 9 eligible choices. Selected cost: 55.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 Ellery · Early Phones

Stage: initial. 8 eligible choices. Selected cost: 56.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 · Hollis Vantreese · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 105.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 · Hazel Northcott · Late Phones

Stage: initial. 6 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 19 · Greer Whitlock · Late Phones

Stage: initial. 2 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.
Mon, Oct 19 · Dario Nettleford · Late Phones

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.
Mon, Oct 19 · Uma Farrant · Late Phones

Stage: initial. 7 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.
Tue, Oct 20 · Soren Ormond · Early Phones

Stage: initial. 3 eligible choices. Selected cost: 62.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 · Dario Nettleford · Early Phones

Stage: initial. 10 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 20 · Uma Farrant · Early Phones

Stage: initial. 8 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 20 · Juno Wexford · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 119.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 · Hazel Northcott · Late Phones

Stage: initial. 7 eligible choices. Selected cost: 62.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 · Greer Whitlock · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 119.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 · Tamsin Ibarra · Late Phones

Stage: initial. 2 eligible choices. Selected cost: 62.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 Ellery · Late Phones

Stage: initial. 6 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 · Hazel Northcott · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 106.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 · Tamsin Ibarra · Early Phones

Stage: initial. 2 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.
Wed, Oct 21 · Saoirse Ellery · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 113.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 · Hollis Vantreese · Early Phones

Stage: initial. 9 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 · Soren Ormond · Late Phones

Stage: initial. 1 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.
Wed, Oct 21 · Dario Nettleford · Late Phones

Stage: initial. 6 eligible choices. Selected cost: 62.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 · Uma Farrant · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 62.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 Wexford · Late Phones

Stage: initial. 4 eligible choices. Selected cost: 64.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 · Soren Ormond · Early Phones

Stage: initial. 2 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.
Thu, Oct 22 · Dario Nettleford · Early Phones

Stage: initial. 9 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.
Thu, Oct 22 · Juno Wexford · Early Phones

Stage: initial. 8 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.
Thu, Oct 22 · Hollis Vantreese · Early Phones

Stage: initial. 7 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.
Thu, Oct 22 · Hazel Northcott · Late Phones

Stage: initial. 6 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.
Thu, Oct 22 · Pax Hadley · Late Phones

Stage: initial. 4 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.
Thu, Oct 22 · Tamsin Ibarra · Late Phones

Stage: initial. 1 eligible choices. Selected cost: 75.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 · Uma Farrant · Late Phones

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.
Fri, Oct 23 · Hazel Northcott · Early Phones

Stage: target-repair. 1 eligible choices. Selected cost: 115.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 · Tamsin Ibarra · Early Phones

Stage: initial. 2 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.
Fri, Oct 23 · Juno Wexford · Early Phones

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 · Saoirse Ellery · Early Phones

Stage: initial. 7 eligible choices. Selected cost: 73.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 · Soren Ormond · Late Phones

Stage: initial. 1 eligible choices. Selected cost: 83.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 · Dario Nettleford · Late Phones

Stage: initial. 6 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 23 · Uma Farrant · Late Phones

Stage: initial. 4 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.
Fri, Oct 23 · Hollis Vantreese · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 75.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 · Greer Whitlock · Saturday Phones

Stage: initial. 3 eligible choices. Selected cost: 55.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 Wexford · Saturday Phones

Stage: target-repair. 1 eligible choices. Selected cost: 66.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 · Hazel Northcott · Early Phones

Stage: initial. 10 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 · Greer Whitlock · Early Phones

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.
Mon, Oct 26 · Juno Wexford · Early Phones

Stage: initial. 9 eligible choices. Selected cost: 78.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 · Hollis Vantreese · Early Phones

Stage: initial. 8 eligible choices. Selected cost: 78.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 · Soren Ormond · Late Phones

Stage: initial. 2 eligible choices. Selected cost: 87.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 · Tamsin Ibarra · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 115.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 · Dario Nettleford · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 82.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 · Saoirse Ellery · Late Phones

Stage: initial. 6 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.
Tue, Oct 27 · Hazel Northcott · Early Phones

Stage: initial. 9 eligible choices. Selected cost: 83.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 · Greer Whitlock · Early Phones

Stage: initial. 3 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.
Tue, Oct 27 · Uma Farrant · Early Phones

Stage: initial. 8 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.
Tue, Oct 27 · Saoirse Ellery · Early Phones

Stage: initial. 10 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 · Tamsin Ibarra · Late Phones

Stage: initial. 2 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.
Tue, Oct 27 · Dario Nettleford · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 87.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 Wexford · Late Phones

Stage: initial. 6 eligible choices. Selected cost: 82.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 · Hollis Vantreese · Late Phones

Stage: target-repair. 1 eligible choices. Selected cost: 127.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 · Hazel Northcott · Early Phones

Stage: initial. 9 eligible choices. Selected cost: 87.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 · Soren Ormond · Early Phones

Stage: initial. 3 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.
Wed, Oct 28 · Dario Nettleford · Early Phones

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.
Wed, Oct 28 · Saoirse Ellery · Early Phones

Stage: initial. 8 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.
Wed, Oct 28 · Greer Whitlock · Late Phones

Stage: initial. 2 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 · Tamsin Ibarra · Late Phones

Stage: initial. 5 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.
Wed, Oct 28 · Juno Wexford · Late Phones

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.
Wed, Oct 28 · Hollis Vantreese · Late Phones

Stage: initial. 7 eligible choices. Selected cost: 83.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 · Greer Whitlock · Early Phones

Stage: initial. 3 eligible choices. Selected cost: 95.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 · Dario Nettleford · Early Phones

Stage: initial. 9 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.
Thu, Oct 29 · Uma Farrant · Early Phones

Stage: initial. 10 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 · Juno Wexford · Early Phones

Stage: initial. 8 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.
Thu, Oct 29 · Hazel Northcott · Late Phones

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.
Thu, Oct 29 · Soren Ormond · Late Phones

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 · Saoirse Ellery · Late Phones

Stage: initial. 5 eligible choices. Selected cost: 94.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 · Hollis Vantreese · Late Phones

Stage: initial. 7 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 · Pax Hadley · Early Phones

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

  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 · Quinn Eastlake · Early Phones

Stage: initial. 9 eligible choices. Selected cost: 95.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.
Fri, Oct 30 · Tamsin Ibarra · Early Phones

Stage: initial. 3 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.
Fri, Oct 30 · Hollis Vantreese · Early Phones

Stage: initial. 10 eligible choices. Selected cost: 94.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 · Hazel Northcott · Late Phones

Stage: initial. 5 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.
Fri, Oct 30 · Greer Whitlock · Late Phones

Stage: initial. 2 eligible choices. Selected cost: 94.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 · Uma Farrant · Late Phones

Stage: initial. 6 eligible choices. Selected cost: 95.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 Wexford · Late Phones

Stage: initial. 7 eligible choices. Selected cost: 94.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 · Soren Ormond · Saturday Phones

Stage: initial. 3 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 31 · Uma Farrant · Saturday Phones

Stage: target-repair. 1 eligible choices. Selected cost: 66.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.