Ambervoy Elementary

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.

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

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

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

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

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.

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

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

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

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

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.

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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.

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.

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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.

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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.

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: request-repair. 1 eligible choices. Selected cost: 91.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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