Schedultary

Movie theater · 32 people

Lumenhall Cinema

A movie theater with heavier Friday and Saturday crews and a shift lead on every 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.

Lumenhall Cinema

Interactive demo · Fictional company

Try both sides of Lumenhall Cinema, a 32-person movie theater. Changes stay on this page and reset when you reload. No account needed.

Try Both Sides

You are Juno, the schedule manager.

Published Schedule

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

Published
Team Members
32
Assigned Shifts
461
Days Short
0
Rule Conflicts
0

October 2026

MonTueWedThuFriSatSun

Thu, Oct 1

  • Zane LockhartOpen · 11 AM to 4 PM
  • Imani FenwickOpen · 11 AM to 4 PM
  • Dev CorridenOpen · 11 AM to 4 PM
  • Bram MerrimanMid · 2 PM to 8 PM
  • Otto ThorneMid · 2 PM to 8 PM
  • Teo BlakemoreMid · 2 PM to 8 PM
  • Ilse JessopMid · 2 PM to 8 PM
  • Wren InskipClose · 5 PM to 11:30 PM
  • Kenji PennickClose · 5 PM to 11:30 PM
  • Vance WexfordClose · 5 PM to 11:30 PM
  • Una QuarlesClose · 5 PM to 11:30 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 · Wren Inskip · Close

Stage: initial. 23 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 · Kenji Pennick · Close

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 · Vance Wexford · Close

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 · Una Quarles · Close

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 · Bram Merriman · Mid

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

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

Stage: initial. 25 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 · Teo Blakemore · Mid

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

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

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

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

Stage: initial. 28 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 · Imani Fenwick · Open

Stage: initial. 27 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 · Dev Corriden · Open

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

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

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 · Amara Ellery · Close

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 · Soren Lanyon · Close

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 · Jonah Selwyn · Close

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 · Cyrus Ambrose · Close

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 · Beckett Marchbank · Close

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.
Fri, Oct 2 · Zane Lockhart · Late Close

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

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

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

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

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

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

Stage: initial. 13 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 · Vida Tolliver · Late Close

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 · Joss Dorsey · Late Close

Stage: initial. 12 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 Whitlock · Mid

Stage: initial. 23 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 · Farid Eastlake · Mid

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.
Fri, Oct 2 · Yara Lisle · Mid

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.
Fri, Oct 2 · Hazel Stavely · Mid

Stage: initial. 20 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 · Lior Calder · Mid

Stage: initial. 19 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 · Ines Farrant · Mid

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

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

Stage: initial. 27 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 · Rosalind Birchall · Open

Stage: initial. 26 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 Ivers · Open

Stage: initial. 25 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 · Esme Pembry · Open

Stage: initial. 24 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 · Uma Yarrow · Open

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

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

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

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

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

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

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

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

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

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

Stage: initial. 5 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.
Sat, Oct 3 · Joss Dorsey · Close

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.
Sat, Oct 3 · Wren Inskip · Late Close

Stage: initial. 11 eligible choices. Selected cost: 8.33.

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

Stage: initial. 10 eligible choices. Selected cost: 8.33.

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

Stage: initial. 9 eligible choices. Selected cost: 8.33.

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

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

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

Stage: initial. 12 eligible choices. Selected cost: 7.50.

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

Stage: initial. 4 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.
Sat, Oct 3 · Ada Goss · Mid

Stage: initial. 23 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 · Rosalind Birchall · Mid

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

Stage: initial. 21 eligible choices. Selected cost: 6.50.

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

Stage: initial. 20 eligible choices. Selected cost: 6.50.

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

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

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

Stage: initial. 27 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 · Vance Wexford · Open

Stage: initial. 26 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 · Flora Kinsella · Open

Stage: initial. 25 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 · Ilse Jessop · Open

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

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

Stage: initial. 24 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 · Bram Merriman · Close

Stage: initial. 21 eligible choices. Selected cost: 12.00.

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

Stage: initial. 23 eligible choices. Selected cost: 9.00.

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

Stage: initial. 22 eligible choices. Selected cost: 9.00.

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

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

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

Stage: initial. 25 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.
Sun, Oct 4 · Imani Fenwick · Mid

Stage: initial. 24 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.
Sun, Oct 4 · Dev Corriden · Mid

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

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

Stage: initial. 26 eligible choices. Selected cost: 9.00.

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

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

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

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

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

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

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

Stage: initial. 23 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 · Rosalind Birchall · Close

Stage: initial. 22 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 Ivers · Close

Stage: initial. 21 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.
Mon, Oct 5 · Uma Yarrow · Close

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

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

Stage: initial. 26 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 · Flora Kinsella · Mid

Stage: initial. 25 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 · Amara Ellery · Mid

Stage: initial. 24 eligible choices. Selected cost: 12.00.

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

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

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

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

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

Stage: initial. 28 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 · Joss Dorsey · Open

Stage: initial. 27 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 · Zane Lockhart · Close

Stage: initial. 21 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.
Tue, Oct 6 · Esme Pembry · Close

Stage: initial. 23 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.
Tue, Oct 6 · Yara Lisle · Close

Stage: initial. 22 eligible choices. Selected cost: 13.67.

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

Stage: initial. 5 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.
Tue, Oct 6 · Soren Lanyon · Mid

Stage: initial. 26 eligible choices. Selected cost: 12.00.

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

Stage: initial. 25 eligible choices. Selected cost: 12.67.

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

Stage: initial. 24 eligible choices. Selected cost: 12.67.

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

Stage: initial. 6 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.
Tue, Oct 6 · Otto Thorne · Open

Stage: initial. 28 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.
Tue, Oct 6 · Teo Blakemore · Open

Stage: initial. 27 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.
Tue, Oct 6 · Dev Corriden · Open

Stage: initial. 7 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 · Bram Merriman · Close

Stage: initial. 22 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.
Wed, Oct 7 · Vance Wexford · Close

Stage: initial. 21 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.
Wed, Oct 7 · Dev Corriden · Close

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

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

Stage: initial. 23 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 · Imani Fenwick · Mid

Stage: initial. 24 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.
Wed, Oct 7 · Kenji Pennick · Mid

Stage: initial. 26 eligible choices. Selected cost: 13.67.

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

Stage: initial. 6 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.
Wed, Oct 7 · Joss Dorsey · Mid

Stage: initial. 25 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 · Wren Inskip · Open

Stage: initial. 27 eligible choices. Selected cost: 12.67.

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

Stage: initial. 28 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.
Wed, Oct 7 · Ilse Jessop · Open

Stage: initial. 7 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 · Imani Fenwick · Close

Stage: initial. 22 eligible choices. Selected cost: 20.00.

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

Stage: initial. 21 eligible choices. Selected cost: 21.50.

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

Stage: initial. 20 eligible choices. Selected cost: 21.50.

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

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

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

Stage: initial. 25 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 · Rosalind Birchall · Mid

Stage: initial. 24 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 · Flora Kinsella · Mid

Stage: initial. 23 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 · Beckett Marchbank · Mid

Stage: initial. 6 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 · Farid Eastlake · Open

Stage: initial. 27 eligible choices. Selected cost: 12.67.

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

Stage: initial. 26 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 · Ines Farrant · Open

Stage: initial. 7 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 · Zane Lockhart · Close

Stage: initial. 17 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.
Fri, Oct 9 · Ada Goss · Close

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.
Fri, Oct 9 · Rosalind Birchall · Close

Stage: initial. 15 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.
Fri, Oct 9 · Flora Kinsella · Close

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

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

Stage: initial. 5 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 · Joss Dorsey · Close

Stage: initial. 14 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.
Fri, Oct 9 · Esme Pembry · Late Close

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

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

Stage: initial. 11 eligible choices. Selected cost: 20.67.

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

Stage: initial. 10 eligible choices. Selected cost: 20.67.

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

Stage: initial. 9 eligible choices. Selected cost: 20.67.

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

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

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

Stage: initial. 12 eligible choices. Selected cost: 20.00.

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

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

Stage: initial. 21 eligible choices. Selected cost: 21.50.

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

Stage: initial. 20 eligible choices. Selected cost: 21.50.

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

Stage: initial. 22 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 · Vance Wexford · Mid

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

Stage: initial. 6 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.
Fri, Oct 9 · Kenji Pennick · Open

Stage: initial. 23 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 · Lior Calder · Open

Stage: initial. 26 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.
Fri, Oct 9 · Amara Ellery · Open

Stage: initial. 25 eligible choices. Selected cost: 16.75.

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

Stage: initial. 24 eligible choices. Selected cost: 16.75.

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

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

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

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.
Sat, Oct 10 · Otto Thorne · Close

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

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

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

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

Stage: initial. 16 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.
Sat, Oct 10 · Beckett Marchbank · Close

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

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

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

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

Stage: initial. 9 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.
Sat, Oct 10 · Vance Wexford · Late Close

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 23 eligible choices. Selected cost: 29.25.

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

Stage: initial. 19 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.
Sat, Oct 10 · Amara Ellery · Mid

Stage: initial. 22 eligible choices. Selected cost: 29.25.

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

Stage: initial. 21 eligible choices. Selected cost: 29.25.

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

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

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

Stage: initial. 24 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.
Sat, Oct 10 · Yusuf Ivers · Open

Stage: initial. 25 eligible choices. Selected cost: 23.75.

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

Stage: initial. 27 eligible choices. Selected cost: 21.67.

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

Stage: initial. 26 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.
Sat, Oct 10 · Uma Yarrow · Open

Stage: initial. 7 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 · Amara Ellery · Close

Stage: initial. 23 eligible choices. Selected cost: 34.50.

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

Stage: initial. 22 eligible choices. Selected cost: 34.50.

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

Stage: initial. 21 eligible choices. Selected cost: 34.67.

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

Stage: initial. 5 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 · Kenji Pennick · Mid

Stage: initial. 25 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 · Yusuf Ivers · Mid

Stage: initial. 26 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 · Farid Eastlake · Mid

Stage: initial. 24 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 · Ilse Jessop · Mid

Stage: initial. 6 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 · Wren Inskip · Open

Stage: initial. 27 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 · Esme Pembry · Open

Stage: initial. 28 eligible choices. Selected cost: 31.50.

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

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

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

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

Mon, Oct 12 · Dev Corriden · Close

Stage: initial. 5 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 · Yusuf Ivers · Close

Stage: initial. 22 eligible choices. Selected cost: 34.25.

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

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

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

Stage: initial. 26 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 · Yara Lisle · Mid

Stage: initial. 25 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 · Cyrus Ambrose · Mid

Stage: initial. 24 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 Quarles · Mid

Stage: initial. 6 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 · Otto Thorne · Open

Stage: initial. 28 eligible choices. Selected cost: 29.50.

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

Stage: initial. 27 eligible choices. Selected cost: 29.50.

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

Stage: initial. 7 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.
Tue, Oct 13 · Hazel Stavely · Close

Stage: initial. 23 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 · Flora Kinsella · Close

Stage: initial. 22 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 · Cleo Holloway · Close

Stage: initial. 21 eligible choices. Selected cost: 35.00.

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

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

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

Stage: initial. 26 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 · Ada Goss · Mid

Stage: initial. 25 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 · Rosalind Birchall · Mid

Stage: initial. 24 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 · Ines Farrant · Mid

Stage: initial. 6 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 · Bram Merriman · Open

Stage: initial. 27 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.
Tue, Oct 13 · Arlo Whitlock · Open

Stage: initial. 28 eligible choices. Selected cost: 29.50.

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

Stage: initial. 7 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 · Farid Eastlake · Close

Stage: initial. 23 eligible choices. Selected cost: 36.33.

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

Stage: initial. 22 eligible choices. Selected cost: 36.33.

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

Stage: initial. 21 eligible choices. Selected cost: 36.33.

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

Stage: initial. 5 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 · Esme Pembry · Mid

Stage: initial. 26 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 · Lior Calder · Mid

Stage: initial. 25 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 Selwyn · Mid

Stage: initial. 24 eligible choices. Selected cost: 36.33.

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

Stage: initial. 6 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 · Ada Goss · Open

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

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

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

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

Stage: initial. 28 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 · Bram Merriman · Close

Stage: initial. 22 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.
Thu, Oct 15 · Rosalind Birchall · Close

Stage: initial. 21 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.
Thu, Oct 15 · Yusuf Ivers · Close

Stage: initial. 20 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.
Thu, Oct 15 · Ilse Jessop · Close

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

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

Stage: initial. 23 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.
Thu, Oct 15 · Wren Inskip · Mid

Stage: initial. 25 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 · Dev Corriden · Mid

Stage: initial. 6 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.
Thu, Oct 15 · Joss Dorsey · Mid

Stage: initial. 24 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 · Amara Ellery · Open

Stage: initial. 27 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.
Thu, Oct 15 · Soren Lanyon · Open

Stage: initial. 26 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.
Thu, Oct 15 · Vida Tolliver · Open

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

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

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.
Fri, Oct 16 · Wren Inskip · Close

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

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

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.
Fri, Oct 16 · Esme Pembry · Close

Stage: initial. 14 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 · Una Quarles · Close

Stage: initial. 5 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.
Fri, Oct 16 · Vida Tolliver · Close

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

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

Stage: initial. 10 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 · Rosalind Birchall · Late Close

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

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

Stage: initial. 12 eligible choices. Selected cost: 35.75.

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

Stage: initial. 13 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.
Fri, Oct 16 · Lior Calder · Late Close

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

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

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

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

Stage: initial. 22 eligible choices. Selected cost: 43.75.

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

Stage: initial. 20 eligible choices. Selected cost: 44.67.

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

Stage: initial. 21 eligible choices. Selected cost: 43.75.

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

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

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

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

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

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

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

Stage: initial. 27 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.
Fri, Oct 16 · Otto Thorne · Open

Stage: initial. 24 eligible choices. Selected cost: 40.25.

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

Stage: initial. 26 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.
Fri, Oct 16 · Dev Corriden · Open

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

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

Stage: initial. 25 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.
Sat, Oct 17 · Dev Corriden · Close

Stage: initial. 5 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.
Sat, Oct 17 · Arlo Whitlock · Close

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

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

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

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

Stage: initial. 17 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.
Sat, Oct 17 · Soren Lanyon · Close

Stage: initial. 16 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.
Sat, Oct 17 · Joss Dorsey · Close

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.
Sat, Oct 17 · Zane Lockhart · Late Close

Stage: initial. 12 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.
Sat, Oct 17 · Teo Blakemore · Late Close

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

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

Stage: initial. 9 eligible choices. Selected cost: 49.25.

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

Stage: initial. 4 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 · Uma Yarrow · Late Close

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

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

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

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

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

Stage: initial. 21 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 · Vance Wexford · Mid

Stage: initial. 20 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.
Sat, Oct 17 · Flora Kinsella · Mid

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

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

Stage: initial. 19 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.
Sat, Oct 17 · Beckett Marchbank · Mid

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

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

Stage: initial. 25 eligible choices. Selected cost: 46.33.

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

Stage: initial. 24 eligible choices. Selected cost: 46.33.

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

Stage: initial. 26 eligible choices. Selected cost: 44.67.

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

Stage: initial. 27 eligible choices. Selected cost: 42.67.

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

Stage: initial. 7 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.
Sun, Oct 18 · Otto Thorne · Close

Stage: initial. 21 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.
Sun, Oct 18 · Kenji Pennick · Close

Stage: initial. 22 eligible choices. Selected cost: 54.67.

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

Stage: initial. 23 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.
Sun, Oct 18 · Ines Farrant · Close

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

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

Stage: initial. 26 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 · Flora Kinsella · Mid

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

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

Stage: initial. 24 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.
Sun, Oct 18 · Ada Goss · Open

Stage: initial. 27 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 · Rosalind Birchall · Open

Stage: initial. 28 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 · Uma Yarrow · Open

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

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

Stage: initial. 23 eligible choices. Selected cost: 50.25.

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

Stage: initial. 22 eligible choices. Selected cost: 53.67.

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

Stage: initial. 21 eligible choices. Selected cost: 53.67.

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

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

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

Stage: initial. 24 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.
Mon, Oct 19 · Yusuf Ivers · Mid

Stage: initial. 25 eligible choices. Selected cost: 51.50.

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

Stage: initial. 26 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 · Ilse Jessop · Mid

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

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

Stage: initial. 28 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.
Mon, Oct 19 · Lior Calder · Open

Stage: initial. 27 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.
Mon, Oct 19 · Beckett Marchbank · Open

Stage: initial. 7 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.
Tue, Oct 20 · Imani Fenwick · Close

Stage: initial. 23 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.
Tue, Oct 20 · Ilse Jessop · Close

Stage: initial. 5 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 · Jonah Selwyn · Close

Stage: initial. 21 eligible choices. Selected cost: 55.33.

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

Stage: initial. 22 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.
Tue, Oct 20 · Zane Lockhart · Mid

Stage: initial. 24 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.
Tue, Oct 20 · Dev Corriden · Mid

Stage: initial. 6 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.
Tue, Oct 20 · Esme Pembry · Mid

Stage: initial. 26 eligible choices. Selected cost: 54.75.

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

Stage: initial. 25 eligible choices. Selected cost: 55.25.

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

Stage: initial. 28 eligible choices. Selected cost: 47.67.

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

Stage: initial. 27 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.
Tue, Oct 20 · Beckett Marchbank · Open

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

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

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

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

Stage: initial. 21 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.
Wed, Oct 21 · Flora Kinsella · Close

Stage: initial. 22 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 · Uma Yarrow · Close

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

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

Stage: initial. 23 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.
Wed, Oct 21 · Amara Ellery · Mid

Stage: initial. 25 eligible choices. Selected cost: 53.50.

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

Stage: initial. 24 eligible choices. Selected cost: 55.33.

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

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

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

Stage: initial. 26 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.
Wed, Oct 21 · Cleo Holloway · Open

Stage: initial. 27 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.
Wed, Oct 21 · Vida Tolliver · Open

Stage: initial. 7 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.
Thu, Oct 22 · Zane Lockhart · Close

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

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

Stage: initial. 21 eligible choices. Selected cost: 59.75.

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

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

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

Stage: initial. 22 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.
Thu, Oct 22 · Yara Lisle · Mid

Stage: initial. 25 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.
Thu, Oct 22 · Soren Lanyon · Mid

Stage: initial. 23 eligible choices. Selected cost: 59.75.

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

Stage: initial. 24 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.
Thu, Oct 22 · Beckett Marchbank · Mid

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

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

Stage: initial. 27 eligible choices. Selected cost: 53.75.

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

Stage: initial. 26 eligible choices. Selected cost: 53.75.

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

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

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

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

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

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

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

Stage: initial. 16 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.
Fri, Oct 23 · Lior Calder · Close

Stage: initial. 13 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.
Fri, Oct 23 · Cleo Holloway · Close

Stage: initial. 15 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.
Fri, Oct 23 · Beckett Marchbank · Close

Stage: initial. 5 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.
Fri, Oct 23 · Otto Thorne · Late Close

Stage: initial. 12 eligible choices. Selected cost: 50.50.

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

Stage: initial. 9 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 · Farid Eastlake · Late Close

Stage: initial. 8 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 · Flora Kinsella · Late Close

Stage: initial. 11 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.
Fri, Oct 23 · Soren Lanyon · Late Close

Stage: initial. 10 eligible choices. Selected cost: 55.50.

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

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

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

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

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

Stage: initial. 22 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 · Rosalind Birchall · Mid

Stage: initial. 21 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 · Yusuf Ivers · Mid

Stage: initial. 20 eligible choices. Selected cost: 65.50.

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

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

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

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

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

Stage: initial. 23 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.
Fri, Oct 23 · Bram Merriman · Open

Stage: initial. 25 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 Whitlock · Open

Stage: initial. 26 eligible choices. Selected cost: 55.00.

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

Stage: initial. 7 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 · Joss Dorsey · Open

Stage: initial. 24 eligible choices. Selected cost: 56.00.

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

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

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

Stage: initial. 18 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.
Sat, Oct 24 · Arlo Whitlock · Close

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

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

Stage: initial. 16 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.
Sat, Oct 24 · Cyrus Ambrose · Close

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

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

Stage: initial. 5 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.
Sat, Oct 24 · Otto Thorne · Late Close

Stage: initial. 10 eligible choices. Selected cost: 69.25.

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

Stage: initial. 12 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.
Sat, Oct 24 · Ilse Jessop · Late Close

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

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

Stage: initial. 11 eligible choices. Selected cost: 68.53.

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

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

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

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

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

Stage: initial. 22 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 · Teo Blakemore · Mid

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

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

Stage: initial. 21 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 · Rosalind Birchall · Mid

Stage: initial. 20 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 · Farid Eastlake · Mid

Stage: initial. 23 eligible choices. Selected cost: 76.87.

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

Stage: initial. 6 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.
Sat, Oct 24 · Zane Lockhart · Open

Stage: initial. 25 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.
Sat, Oct 24 · Imani Fenwick · Open

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

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

Stage: initial. 7 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.
Sat, Oct 24 · Esme Pembry · Open

Stage: initial. 27 eligible choices. Selected cost: 65.50.

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

Stage: initial. 26 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 · Zane Lockhart · Close

Stage: initial. 21 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.
Sun, Oct 25 · Rosalind Birchall · Close

Stage: initial. 23 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.
Sun, Oct 25 · Amara Ellery · Close

Stage: initial. 22 eligible choices. Selected cost: 79.25.

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

Stage: initial. 5 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.
Sun, Oct 25 · Otto Thorne · Mid

Stage: initial. 25 eligible choices. Selected cost: 78.85.

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

Stage: initial. 26 eligible choices. Selected cost: 76.75.

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

Stage: initial. 24 eligible choices. Selected cost: 80.50.

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

Stage: initial. 6 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.
Sun, Oct 25 · Yara Lisle · Open

Stage: initial. 27 eligible choices. Selected cost: 72.53.

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

Stage: initial. 28 eligible choices. Selected cost: 70.75.

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

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

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

Stage: initial. 23 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 · Arlo Whitlock · Close

Stage: initial. 21 eligible choices. Selected cost: 72.60.

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

Stage: initial. 22 eligible choices. Selected cost: 68.85.

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

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

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

Stage: initial. 24 eligible choices. Selected cost: 74.20.

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

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

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

Stage: initial. 25 eligible choices. Selected cost: 72.60.

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

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

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

Stage: initial. 28 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.
Mon, Oct 26 · Flora Kinsella · Open

Stage: initial. 27 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.
Mon, Oct 26 · Una Quarles · Open

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

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

Stage: initial. 23 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.
Tue, Oct 27 · Rosalind Birchall · Close

Stage: initial. 22 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.
Tue, Oct 27 · Ines Farrant · Close

Stage: initial. 5 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.
Tue, Oct 27 · Beckett Marchbank · Close

Stage: initial. 21 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.
Tue, Oct 27 · Imani Fenwick · Mid

Stage: initial. 26 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 · Teo Blakemore · Mid

Stage: initial. 25 eligible choices. Selected cost: 73.85.

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

Stage: initial. 24 eligible choices. Selected cost: 73.85.

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

Stage: initial. 6 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.
Tue, Oct 27 · Ada Goss · Open

Stage: initial. 27 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.
Tue, Oct 27 · Yusuf Ivers · Open

Stage: initial. 28 eligible choices. Selected cost: 66.60.

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

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

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

Stage: initial. 23 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.
Wed, Oct 28 · Ada Goss · Close

Stage: initial. 21 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 · Una Quarles · Close

Stage: initial. 5 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.
Wed, Oct 28 · Joss Dorsey · Close

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

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

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

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

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

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

Stage: initial. 6 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 · Beckett Marchbank · Mid

Stage: initial. 24 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 · Zane Lockhart · Open

Stage: initial. 28 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.
Wed, Oct 28 · Flora Kinsella · Open

Stage: initial. 27 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 · Vida Tolliver · Open

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

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

Stage: initial. 21 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 · Esme Pembry · Close

Stage: initial. 23 eligible choices. Selected cost: 81.85.

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

Stage: initial. 22 eligible choices. Selected cost: 83.00.

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

Stage: initial. 5 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.
Thu, Oct 29 · Lior Calder · Mid

Stage: initial. 26 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 · Cleo Holloway · Mid

Stage: initial. 25 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 · Una Quarles · Mid

Stage: initial. 6 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.
Thu, Oct 29 · Ines Farrant · Mid

Stage: initial. 24 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 · Vance Wexford · Open

Stage: initial. 28 eligible choices. Selected cost: 75.00.

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

Stage: initial. 7 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.
Thu, Oct 29 · Joss Dorsey · Open

Stage: initial. 27 eligible choices. Selected cost: 75.00.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 5 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 · Wren Inskip · Late Close

Stage: initial. 11 eligible choices. Selected cost: 77.20.

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

Stage: initial. 10 eligible choices. Selected cost: 77.20.

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

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

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

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

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

Stage: initial. 4 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.
Fri, Oct 30 · Cyrus Ambrose · Late Close

Stage: initial. 9 eligible choices. Selected cost: 78.87.

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

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

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

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

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

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

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

Stage: initial. 23 eligible choices. Selected cost: 83.00.

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

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

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

Stage: initial. 22 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.
Fri, Oct 30 · Zane Lockhart · Open

Stage: initial. 24 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 · Bram Merriman · Open

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

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

Stage: initial. 25 eligible choices. Selected cost: 80.85.

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

Stage: initial. 26 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 · Ines Farrant · Open

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 11 eligible choices. Selected cost: 94.10.

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

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

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

Stage: initial. 12 eligible choices. Selected cost: 93.60.

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

Stage: initial. 10 eligible choices. Selected cost: 94.85.

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

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

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

Stage: initial. 9 eligible choices. Selected cost: 95.00.

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

Stage: initial. 23 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 · Farid Eastlake · Mid

Stage: initial. 21 eligible choices. Selected cost: 101.87.

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

Stage: initial. 20 eligible choices. Selected cost: 103.00.

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

Stage: initial. 22 eligible choices. Selected cost: 96.87.

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

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

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

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

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

Stage: initial. 27 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.
Sat, Oct 31 · Bram Merriman · Open

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

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

Stage: initial. 26 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.
Sat, Oct 31 · Dev Corriden · Open

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

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

Stage: initial. 24 eligible choices. Selected cost: 92.00.

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