Wendlecroft Dairy

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

1. Evaluated this recipient for a workload-target repair; choice count is this repair step only.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and 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: 1.50.

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

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

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

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: initial. 6 eligible choices. Selected cost: 1.50.

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

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

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

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

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

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

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

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

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

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: initial. 3 eligible choices. Selected cost: 2.00.

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

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

1. Evaluated this recipient for a workload-target repair; choice count is this repair step only.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and 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: 1.50.

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

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. 6 eligible choices. Selected cost: 5.50.

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

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

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

Stage: initial. 3 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: 6.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: target-repair. 1 eligible choices. Selected cost: 136.50.

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

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

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

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

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

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

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 14.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: 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. 6 eligible choices. Selected cost: 13.50.

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 18.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. 6 eligible choices. Selected cost: 17.50.

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 14.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. 3 eligible choices. Selected cost: 14.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. 6 eligible choices. Selected cost: 13.50.

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 18.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. 5 eligible choices. Selected cost: 25.50.

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 23.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: 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. 6 eligible choices. Selected cost: 17.50.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 23.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. 5 eligible choices. Selected cost: 25.50.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 31.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. 5 eligible choices. Selected cost: 26.50.

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 27.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. 6 eligible choices. Selected cost: 29.50.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 40.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. 4 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. 6 eligible choices. Selected cost: 39.50.

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

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

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

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

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

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

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

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

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

Stage: initial. 4 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. 3 eligible choices. Selected cost: 45.50.

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

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

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

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

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

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

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 48.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. 4 eligible choices. Selected cost: 43.00.

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

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

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 46.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. 6 eligible choices. Selected cost: 50.50.

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 50.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. 4 eligible choices. Selected cost: 48.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: 50.50.

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

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

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

Stage: initial. 2 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. 6 eligible choices. Selected cost: 53.50.

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

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

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 55.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: 53.50.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 2 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. 6 eligible choices. Selected cost: 62.50.

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 58.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. 3 eligible choices. Selected cost: 64.00.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 72.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. 3 eligible choices. Selected cost: 73.00.

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

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

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 68.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: 74.50.

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 76.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. 6 eligible choices. Selected cost: 72.50.

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

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

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

Stage: initial. 3 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. 6 eligible choices. Selected cost: 74.50.

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 76.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. 3 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. 6 eligible choices. Selected cost: 74.50.

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

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

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

Stage: initial. 1 eligible choices. Selected cost: 73.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. 5 eligible choices. Selected cost: 81.50.

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 81.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: 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. 5 eligible choices. Selected cost: 81.50.

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 76.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. 5 eligible choices. Selected cost: 85.50.

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

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

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

Stage: initial. 3 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. 2 eligible choices. Selected cost: 88.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 1 eligible choices. Selected cost: 84.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. 6 eligible choices. Selected cost: 93.50.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 3 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. 4 eligible choices. Selected cost: 90.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. 5 eligible choices. Selected cost: 101.50.

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 104.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: 111.50.

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 99.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. 3 eligible choices. Selected cost: 109.50.

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 99.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. 6 eligible choices. Selected cost: 101.50.

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

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

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

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

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

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

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

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

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

Stage: initial. 3 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. 4 eligible choices. Selected cost: 108.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. 6 eligible choices. Selected cost: 106.50.

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 102.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. 6 eligible choices. Selected cost: 111.50.

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

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

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

Stage: initial. 4 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. 3 eligible choices. Selected cost: 115.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. 6 eligible choices. Selected cost: 110.50.

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 98.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. 6 eligible choices. Selected cost: 115.50.

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

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

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

Stage: initial. 3 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. 4 eligible choices. Selected cost: 116.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. 6 eligible choices. Selected cost: 106.50.

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

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

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

Stage: initial. 1 eligible choices. Selected cost: 111.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. 6 eligible choices. Selected cost: 118.50.

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

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

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

Stage: initial. 4 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. 3 eligible choices. Selected cost: 126.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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