Schedultary

Pool Service Company · 12 people

Bluvenna Pool Service

A pool service company in the desert that starts routes early to beat the heat and runs fewer routes in winter.

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.

Bluvenna Pool Service

Interactive demo · Fictional company

Try both sides of Bluvenna Pool Service, a 12-person pool service company. Changes stay on this page and reset when you reload. No account needed.

Try Both Sides

You are Cleo, the schedule manager.

Published Schedule

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

Published
Team Members
12
Assigned Shifts
181
Days Short
0
Rule Conflicts
0

October 2026

MonTueWedThuFriSatSun

Thu, Oct 1

  • Wynn ThorneCleaning Routes · 6:30 AM to 3 PM
  • Kaia BlakemoreCleaning Routes · 6:30 AM to 3 PM
  • Juno InskipCleaning Routes · 6:30 AM to 3 PM
  • Joss PennickCleaning Routes · 6:30 AM to 3 PM
  • Gus WexfordCleaning Routes · 6:30 AM to 3 PM
  • Hollis GossCleaning Routes · 6:30 AM to 3 PM
  • Tamsin PembryEquipment Repair · 8 AM to 4:30 PM
  • Dev WhitlockEquipment Repair · 8 AM to 4: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 · Wynn Thorne · Cleaning Routes

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

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

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.
Thu, Oct 1 · Juno Inskip · Cleaning Routes

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 · Tamsin Pembry · Equipment Repair

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.
Tue, Oct 6 · Gus Wexford · Cleaning Routes

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

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

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

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

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

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

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

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

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

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

Stage: initial. 7 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.
Wed, Oct 7 · Joss Pennick · Cleaning Routes

Stage: initial. 6 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.
Wed, Oct 7 · Gus Wexford · Cleaning Routes

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

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

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

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

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

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

Stage: initial. 3 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.
Wed, Oct 7 · Amara Eastlake · Equipment Repair

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 · Wynn Thorne · Equipment Repair

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

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

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.
Thu, Oct 8 · Juno Inskip · Cleaning Routes

Stage: initial. 4 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.
Thu, Oct 8 · Joss Pennick · Cleaning Routes

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

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

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

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

Stage: initial. 6 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 8 · Rafe Ivers · Cleaning Routes

Stage: initial. 5 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 8 · Dev Whitlock · Equipment Repair

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

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

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

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

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

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

Stage: initial. 6 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 9 · Juno Inskip · Cleaning Routes

Stage: initial. 4 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 9 · Joss Pennick · Cleaning Routes

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

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

Stage: initial. 8 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.
Fri, Oct 9 · Hollis Goss · Cleaning Routes

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.
Fri, Oct 9 · Tamsin Pembry · Equipment Repair

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

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

Stage: initial. 1 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 · Amara Eastlake · Saturday Green Pool Cleanups

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

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

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

Mon, Oct 12 · Juno Inskip · Cleaning Routes

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

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

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

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

Stage: initial. 7 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.
Mon, Oct 12 · Zane Birchall · Cleaning Routes

Stage: initial. 6 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.
Mon, Oct 12 · Rafe Ivers · Cleaning Routes

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 2 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 · Wynn Thorne · Cleaning Routes

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

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

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

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

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

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

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

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

Stage: initial. 8 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.
Wed, Oct 14 · Zane Birchall · Cleaning Routes

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

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

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

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

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

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

Stage: initial. 3 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.
Thu, Oct 15 · Kaia Blakemore · Cleaning Routes

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

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

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

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

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

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

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

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

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.
Thu, Oct 15 · Dev Whitlock · Equipment Repair

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

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

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

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

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

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

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

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

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

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

Stage: initial. 8 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 16 · Zane Birchall · Cleaning Routes

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

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

Stage: initial. 7 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 16 · Wynn Thorne · Equipment Repair

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.
Fri, Oct 16 · Kaia Blakemore · Equipment Repair

Stage: initial. 4 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 · Tamsin Pembry · Saturday Green Pool Cleanups

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.
Mon, Oct 19 · Wynn Thorne · Cleaning Routes

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

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

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

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

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

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

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

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

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.
Mon, Oct 19 · Rafe Ivers · Cleaning Routes

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.
Mon, Oct 19 · Tamsin Pembry · Equipment Repair

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.
Thu, Oct 22 · Joss Pennick · Cleaning Routes

Stage: initial. 4 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.
Thu, Oct 22 · Gus Wexford · Cleaning Routes

Stage: initial. 3 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.
Thu, Oct 22 · Hollis Goss · Cleaning Routes

Stage: initial. 6 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.
Thu, Oct 22 · Zane Birchall · Cleaning Routes

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

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

Stage: initial. 2 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.
Thu, Oct 22 · Tamsin Pembry · Equipment Repair

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

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

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

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

Stage: initial. 5 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.
Fri, Oct 23 · Juno Inskip · Cleaning Routes

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

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

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

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

Stage: initial. 7 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.
Fri, Oct 23 · Zane Birchall · Cleaning Routes

Stage: initial. 6 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.
Fri, Oct 23 · Rafe Ivers · Cleaning Routes

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

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

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

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

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

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

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

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

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

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

Stage: initial. 8 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.
Mon, Oct 26 · Juno Inskip · Cleaning Routes

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 2 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.
Thu, Oct 29 · Amara Eastlake · Equipment Repair

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 3 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.
Fri, Oct 30 · Wynn Thorne · Equipment Repair

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

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

Stage: initial. 11 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.