Thrennick Electric

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 9 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. 8 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. 4 eligible choices. Selected cost: 14.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 8 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. 7 eligible choices. Selected cost: 19.00.

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

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

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

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

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

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

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

Stage: initial. 12 eligible choices. Selected cost: 19.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: 20.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. 7 eligible choices. Selected cost: 24.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 3 eligible choices. Selected cost: 28.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. 12 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: 20.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: 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. 2 eligible choices. Selected cost: 24.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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. 11 eligible choices. Selected cost: 32.00.

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

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

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

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

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

Stage: initial. 2 eligible choices. Selected cost: 28.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. 8 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. 9 eligible choices. Selected cost: 28.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: 29.15.

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

Stage: initial. 11 eligible choices. Selected cost: 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. 10 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. 13 eligible choices. Selected cost: 34.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 40.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. 13 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: 36.00.

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

Stage: initial. 8 eligible choices. Selected cost: 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. 7 eligible choices. Selected cost: 40.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 6 eligible choices. Selected cost: 43.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. 8 eligible choices. Selected cost: 34.00.

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

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

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

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

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

Stage: initial. 11 eligible choices. Selected cost: 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. 10 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. 13 eligible choices. Selected cost: 49.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 12 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. 11 eligible choices. Selected cost: 57.00.

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

Stage: initial. 3 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. 9 eligible choices. Selected cost: 52.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. 7 eligible choices. Selected cost: 57.00.

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

Stage: initial. 3 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. 8 eligible choices. Selected cost: 56.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: 49.97.

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

Stage: initial. 11 eligible choices. Selected cost: 60.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. 12 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. 9 eligible choices. Selected cost: 62.00.

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

Stage: initial. 4 eligible choices. Selected cost: 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. 10 eligible choices. Selected cost: 60.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: 56.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 9 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. 11 eligible choices. Selected cost: 70.00.

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

Stage: initial. 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. 4 eligible choices. Selected cost: 58.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: 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. 8 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. 2 eligible choices. Selected cost: 65.50.

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 10 eligible choices. Selected cost: 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. 4 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. 13 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: 64.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. 8 eligible choices. Selected cost: 67.00.

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

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

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

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

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

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

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

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

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

Stage: initial. 12 eligible choices. Selected cost: 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. 13 eligible choices. Selected cost: 73.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. 10 eligible choices. Selected cost: 80.00.

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

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

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

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

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

Stage: initial. 7 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: request-repair. 1 eligible choices. Selected cost: 103.00.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 13 eligible choices. Selected cost: 77.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: 66.00.

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

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

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

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

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

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

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

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

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

Stage: initial. 13 eligible choices. Selected cost: 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. 10 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. 12 eligible choices. Selected cost: 87.00.

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

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

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

Stage: initial. 11 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. 5 eligible choices. Selected cost: 72.00.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 10 eligible choices. Selected cost: 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. 12 eligible choices. Selected cost: 91.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 9 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. 10 eligible choices. Selected cost: 68.60.

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