Schedultary

Neighborhood grocery store · 24 people

Grevally Market

A neighborhood grocery store open seven days with a manager on every opening and closing 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.

Grevally Market

Interactive demo · Fictional company

Try both sides of Grevally Market, a 24-person neighborhood grocery store. Changes stay on this page and reset when you reload. No account needed.

Try Both Sides

You are Saoirse, the schedule manager.

Published Schedule

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

Published
Team Members
24
Assigned Shifts
341
Days Short
0
Rule Conflicts
0

October 2026

MonTueWedThuFriSatSun

Thu, Oct 1

  • Saoirse DorseyOpening · 7 AM to 1 PM
  • Una FarrantOpening · 7 AM to 1 PM
  • Arlo QuenbyOpening · 7 AM to 1 PM
  • Wren KetteringOpening · 7 AM to 1 PM
  • Yusuf NettlefordMid · 11 AM to 5 PM
  • Rafe KinsellaMid · 11 AM to 5 PM
  • Vida IversMid · 11 AM to 5 PM
  • Teo WexfordClosing · 4 PM to 10 PM
  • Jonah LockhartClosing · 4 PM to 10 PM
  • Wynn CorridenClosing · 4 PM to 10 PM
  • Juno VargaClosing · 4 PM to 10 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 · Teo Wexford · Closing

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

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

Stage: initial. 14 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 · Wynn Corriden · Closing

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

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

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.
Thu, Oct 1 · Yusuf Nettleford · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 83.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 · Rafe Kinsella · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 87.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 · Vida Ivers · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 82.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 Dorsey · Opening

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 · Una Farrant · Opening

Stage: initial. 22 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 · Arlo Quenby · Opening

Stage: initial. 21 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 · Wren Kettering · Opening

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

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

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

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

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

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

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

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

Stage: initial. 14 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 · Arlo Quenby · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 88.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 · Jonah Lockhart · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 93.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 · Wynn Corriden · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 100.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 · Tamsin Jessop · Opening

Stage: initial. 18 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 · Vance Underhill · Opening

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

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

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

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

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

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

Stage: initial. 4 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 · Una Farrant · Closing

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

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

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

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

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

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

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

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

Stage: initial. 18 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 · Wren Kettering · Mid

Stage: initial. 17 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 · Teo Wexford · Opening

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

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

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

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

Stage: initial. 18 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 · Cyrus Thorne · Opening

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

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

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

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

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.
Sun, Oct 4 · Jonah Lockhart · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 135.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.
Sun, Oct 4 · Vida Ivers · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 93.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.
Sun, Oct 4 · Vance Underhill · Mid

Stage: initial. 19 eligible choices. Selected cost: 7.00.

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

Stage: initial. 18 eligible choices. Selected cost: 7.00.

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

Stage: target-repair. 1 eligible choices. Selected cost: 110.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.
Sun, Oct 4 · Teo Wexford · Opening

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.
Sun, Oct 4 · Yusuf Nettleford · Opening

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

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

Stage: initial. 19 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.
Sun, Oct 4 · Rafe Kinsella · Opening

Stage: initial. 18 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 · Vance Underhill · Closing

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

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

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

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

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 90.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 · Una Farrant · Mid

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

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

Stage: initial. 19 eligible choices. Selected cost: 7.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Cyrus Thorne · Mid

Stage: initial. 18 eligible choices. Selected cost: 7.00.

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

Stage: target-repair. 1 eligible choices. Selected cost: 94.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 Jessop · Opening

Stage: target-repair. 1 eligible choices. Selected cost: 95.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 · Wynn Corriden · Opening

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

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

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

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

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 88.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 · Otto Zell · Closing

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

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

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

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

Stage: initial. 19 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.
Tue, Oct 6 · Teo Wexford · Mid

Stage: initial. 18 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.
Tue, Oct 6 · Tamsin Jessop · Mid

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

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

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

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

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 · Jonah Lockhart · Opening

Stage: initial. 18 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.
Tue, Oct 6 · Wren Kettering · Opening

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

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

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

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

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

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

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

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

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.
Wed, Oct 7 · Teo Wexford · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 89.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 7 · Wynn Corriden · Mid

Stage: initial. 18 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 · Vida Ivers · Mid

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 Dorsey · Opening

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 18 eligible choices. Selected cost: 15.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Rafe Kinsella · Mid

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 Jessop · Opening

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

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

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

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

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

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

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

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

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

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

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.
Fri, Oct 9 · Vida Ivers · Closing

Stage: initial. 14 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.
Fri, Oct 9 · Cyrus Thorne · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 88.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 Dorsey · Mid

Stage: initial. 18 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.
Fri, Oct 9 · Una Farrant · Mid

Stage: initial. 17 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.
Fri, Oct 9 · Arlo Quenby · Mid

Stage: initial. 16 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.
Fri, Oct 9 · Teo Wexford · Opening

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

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

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

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

Stage: initial. 4 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.
Fri, Oct 9 · Juno Varga · Opening

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.
Sat, Oct 10 · Teo Wexford · Closing

Stage: initial. 15 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 · Jonah Lockhart · Closing

Stage: initial. 14 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 · Yusuf Nettleford · Closing

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Rafe Kinsella · Closing

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Vance Underhill · Mid

Stage: initial. 19 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 · Ada Gilchrist · Mid

Stage: initial. 18 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 · Juno Varga · Mid

Stage: initial. 17 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 · Saoirse Dorsey · Opening

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

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

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

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

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

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

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.
Sun, Oct 11 · Jonah Lockhart · Closing

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.
Sun, Oct 11 · Vance Underhill · Closing

Stage: initial. 15 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.
Sun, Oct 11 · Ada Gilchrist · Closing

Stage: initial. 14 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.
Sun, Oct 11 · Otto Zell · Closing

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

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

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

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

Stage: initial. 18 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.
Sun, Oct 11 · Yusuf Nettleford · Mid

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

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

Stage: initial. 4 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.
Sun, Oct 11 · Juno Varga · Opening

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.
Sun, Oct 11 · Vida Ivers · Opening

Stage: target-repair. 1 eligible choices. Selected cost: 132.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.
Sun, Oct 11 · Cyrus Thorne · Opening

Stage: initial. 18 eligible choices. Selected cost: 24.00.

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

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

Mon, Oct 12 · Wren Kettering · Closing

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

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

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

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

Stage: initial. 14 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 · Teo Wexford · Mid

Stage: initial. 19 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.
Mon, Oct 12 · Jonah Lockhart · Mid

Stage: initial. 18 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.
Mon, Oct 12 · Rafe Kinsella · Mid

Stage: initial. 17 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.
Mon, Oct 12 · Saoirse Dorsey · Opening

Stage: initial. 4 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 · Una Farrant · Opening

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Arlo Quenby · Opening

Stage: initial. 17 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.
Mon, Oct 12 · Yusuf Nettleford · Opening

Stage: target-repair. 1 eligible choices. Selected cost: 102.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 · Saoirse Dorsey · Closing

Stage: initial. 4 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 · Arlo Quenby · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 84.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 · Vance Underhill · Closing

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 100.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 · Wynn Corriden · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 84.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 · Wren Kettering · Mid

Stage: initial. 18 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 · Juno Varga · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 81.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 · Una Farrant · Opening

Stage: initial. 16 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 · Yusuf Nettleford · Opening

Stage: initial. 4 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 · Otto Zell · Opening

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

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

Stage: initial. 18 eligible choices. Selected cost: 32.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 Jessop · Closing

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

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

Stage: initial. 4 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.
Wed, Oct 14 · Ada Gilchrist · Closing

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 110.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 · Vance Underhill · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 89.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 · Yusuf Nettleford · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 89.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 · Cyrus Thorne · Mid

Stage: initial. 17 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.
Wed, Oct 14 · Teo Wexford · Opening

Stage: initial. 17 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.
Wed, Oct 14 · Jonah Lockhart · Opening

Stage: initial. 16 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.
Wed, Oct 14 · Wren Kettering · Opening

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

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

Stage: initial. 18 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.
Thu, Oct 15 · Saoirse Dorsey · Closing

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

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

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 110.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 Jessop · Closing

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 · Wynn Corriden · Mid

Stage: initial. 18 eligible choices. Selected cost: 36.00.

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

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Cyrus Thorne · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 82.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 · Arlo Quenby · Opening

Stage: initial. 16 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.
Thu, Oct 15 · Jonah Lockhart · Opening

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.
Thu, Oct 15 · Yusuf Nettleford · Opening

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

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

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Una Farrant · Closing

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

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

Stage: initial. 16 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.
Fri, Oct 16 · Jonah Lockhart · Closing

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

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

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

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

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

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

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Cyrus Thorne · Mid

Stage: initial. 18 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.
Fri, Oct 16 · Wren Kettering · Opening

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 Varga · Opening

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

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

Stage: initial. 18 eligible choices. Selected cost: 36.00.

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Vida Ivers · Opening

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

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

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

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

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

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

Stage: initial. 16 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.
Sat, Oct 17 · Cyrus Thorne · Closing

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 124.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.
Sun, Oct 18 · Wren Kettering · Closing

Stage: initial. 4 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.
Sun, Oct 18 · Rafe Kinsella · Closing

Stage: initial. 15 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.
Sun, Oct 18 · Saoirse Dorsey · Mid

Stage: initial. 18 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.
Sun, Oct 18 · Jonah Lockhart · Mid

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

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

Stage: initial. 17 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.
Sun, Oct 18 · Arlo Quenby · Opening

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

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

Stage: initial. 4 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.
Sun, Oct 18 · Ada Gilchrist · Opening

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

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

Stage: initial. 16 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.
Mon, Oct 19 · Arlo Quenby · Closing

Stage: initial. 14 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 · Teo Wexford · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 84.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 · Jonah Lockhart · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 80.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 · Yusuf Nettleford · Closing

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

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

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

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

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 80.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 Jessop · Opening

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

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

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

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

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

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

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

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

Stage: initial. 15 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.
Tue, Oct 20 · Teo Wexford · Closing

Stage: initial. 14 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.
Tue, Oct 20 · Jonah Lockhart · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 88.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 · Yusuf Nettleford · Closing

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

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

Stage: initial. 19 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 · Otto Zell · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 80.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 · Cyrus Thorne · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 93.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 · Saoirse Dorsey · Opening

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

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

Stage: initial. 19 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.
Tue, Oct 20 · Juno Varga · Opening

Stage: initial. 18 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.
Tue, Oct 20 · Rafe Kinsella · Opening

Stage: initial. 17 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.
Wed, Oct 21 · Saoirse Dorsey · Closing

Stage: target-repair. 1 eligible choices. Selected cost: 100.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 · Wren Kettering · Closing

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

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

Stage: initial. 15 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.
Wed, Oct 21 · Rafe Kinsella · Closing

Stage: initial. 14 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.
Wed, Oct 21 · Arlo Quenby · Mid

Stage: initial. 17 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.
Wed, Oct 21 · Wynn Corriden · Mid

Stage: initial. 16 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.
Wed, Oct 21 · Vida Ivers · Mid

Stage: initial. 18 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.
Wed, Oct 21 · Vance Underhill · Opening

Stage: initial. 17 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.
Wed, Oct 21 · Ada Gilchrist · Opening

Stage: target-repair. 1 eligible choices. Selected cost: 84.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 · Otto Zell · Opening

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

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

Stage: initial. 16 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.
Thu, Oct 22 · Ada Gilchrist · Closing

Stage: initial. 15 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.
Thu, Oct 22 · Otto Zell · Closing

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 · Vida Ivers · Closing

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

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

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

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

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

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

Stage: initial. 17 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.
Thu, Oct 22 · Vance Underhill · Mid

Stage: initial. 16 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.
Thu, Oct 22 · Arlo Quenby · Opening

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

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

Stage: initial. 15 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.
Thu, Oct 22 · Wynn Corriden · Opening

Stage: initial. 4 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.
Thu, Oct 22 · Yusuf Nettleford · Opening

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

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

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

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

Stage: target-repair. 1 eligible choices. Selected cost: 100.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 Jessop · Closing

Stage: initial. 13 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.
Fri, Oct 23 · Vance Underhill · Closing

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

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

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

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

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

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

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

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

Stage: initial. 16 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.
Fri, Oct 23 · Arlo Quenby · Opening

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

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

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

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

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

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

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

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

Stage: initial. 4 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.
Sat, Oct 24 · Vance Underhill · Closing

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

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

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

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

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

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

Stage: initial. 17 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.
Sat, Oct 24 · Otto Zell · Mid

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.
Sat, Oct 24 · Jonah Lockhart · Opening

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

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

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.
Sat, Oct 24 · Wren Kettering · Opening

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

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

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.
Sun, Oct 25 · Arlo Quenby · Closing

Stage: initial. 15 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.
Sun, Oct 25 · Tamsin Jessop · Closing

Stage: initial. 14 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.
Sun, Oct 25 · Wynn Corriden · Closing

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

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

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

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

Stage: initial. 17 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.
Sun, Oct 25 · Vida Ivers · Mid

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.
Sun, Oct 25 · Cyrus Thorne · Mid

Stage: initial. 18 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.
Sun, Oct 25 · Una Farrant · Opening

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

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

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

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

Stage: initial. 17 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.
Sun, Oct 25 · Otto Zell · Opening

Stage: initial. 4 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 · Una Farrant · Closing

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

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

Stage: initial. 4 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 · Rafe Kinsella · Closing

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

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

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

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

Stage: initial. 17 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.
Mon, Oct 26 · Yusuf Nettleford · Mid

Stage: initial. 19 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.
Mon, Oct 26 · Otto Zell · Mid

Stage: initial. 18 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.
Mon, Oct 26 · Saoirse Dorsey · Opening

Stage: initial. 4 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 · Jonah Lockhart · Opening

Stage: initial. 17 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.
Mon, Oct 26 · Vance Underhill · Opening

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

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

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

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

Stage: initial. 4 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.
Tue, Oct 27 · Wynn Corriden · Closing

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.
Tue, Oct 27 · Juno Varga · Closing

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

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

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.
Tue, Oct 27 · Una Farrant · Mid

Stage: initial. 18 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.
Tue, Oct 27 · Jonah Lockhart · Mid

Stage: initial. 19 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.
Tue, Oct 27 · Rafe Kinsella · Mid

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

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

Stage: initial. 16 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.
Tue, Oct 27 · Vance Underhill · Opening

Stage: initial. 18 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.
Tue, Oct 27 · Ada Gilchrist · Opening

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

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

Stage: initial. 4 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.
Wed, Oct 28 · Teo Wexford · Closing

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

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

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

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

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

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

Stage: initial. 4 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.
Wed, Oct 28 · Saoirse Dorsey · Mid

Stage: initial. 19 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.
Wed, Oct 28 · Ada Gilchrist · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 93.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 · Wren Kettering · Mid

Stage: target-repair. 1 eligible choices. Selected cost: 89.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 · Una Farrant · Opening

Stage: target-repair. 1 eligible choices. Selected cost: 88.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 · Tamsin Jessop · Opening

Stage: initial. 18 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 28 · Yusuf Nettleford · Opening

Stage: initial. 4 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 · Vida Ivers · Opening

Stage: initial. 17 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 29 · Tamsin Jessop · Closing

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

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

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

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

Stage: initial. 4 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.
Thu, Oct 29 · Juno Varga · Closing

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

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

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

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

Stage: initial. 17 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.
Thu, Oct 29 · Ada Gilchrist · Mid

Stage: initial. 19 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.
Thu, Oct 29 · Wynn Corriden · Opening

Stage: initial. 4 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.
Thu, Oct 29 · Rafe Kinsella · Opening

Stage: initial. 18 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 29 · Vida Ivers · Opening

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

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

Stage: initial. 17 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 30 · Una Farrant · Closing

Stage: initial. 14 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.
Fri, Oct 30 · Jonah Lockhart · Closing

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

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

Stage: initial. 16 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 30 · Yusuf Nettleford · Closing

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

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

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

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

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

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

Stage: initial. 19 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 30 · Saoirse Dorsey · Opening

Stage: initial. 4 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 · Arlo Quenby · Opening

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

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

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

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

Stage: initial. 17 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.
Sat, Oct 31 · Arlo Quenby · Closing

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

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

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.
Sat, Oct 31 · Wren Kettering · Closing

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Juno Varga · Closing

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

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

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

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

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

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

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

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

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

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

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

  1. Evaluate candidates for this placement step.
  2. Check active status, availability, role and skill eligibility.
  3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
  4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
  5. Compare workload, type, weekday, requests and 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 · Rafe Kinsella · Opening

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

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

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.