Brenvaso Home Goods

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

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

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

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

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

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

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

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

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

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

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

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

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

1. Exchanged two duties of the same shift type so a person who prefers certain days works one of them. Both keep their totals.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and call-spacing costs.
6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1. Exchanged two duties of the same shift type so a person who prefers certain days works one of them. Both keep their totals.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and call-spacing 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. 6 eligible choices. Selected cost: 16.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: 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: request-repair. 1 eligible choices. Selected cost: 45.00.

1. Exchanged two duties of the same shift type so a person who prefers certain days works one of them. Both keep their totals.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and call-spacing costs.
6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.

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

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

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

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

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

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

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

1. Exchanged two duties of the same shift type so a person who prefers certain days works one of them. Both keep their totals.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and call-spacing 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: 23.00.

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

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

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

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

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

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

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

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

1. Exchanged two duties of the same shift type so a person who prefers certain days works one of them. Both keep their totals.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and call-spacing 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: 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. 10 eligible choices. Selected cost: 17.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1. Exchanged two duties of the same shift type so a person who prefers certain days works one of them. Both keep their totals.
2. Check active status, availability, role and skill eligibility.
3. Reject overlap, required-rest, consecutive-day and staffing-limit conflicts.
4. Meet required lead and supervisor coverage. Seats that only a few people qualify for are filled first.
5. Compare workload, type, weekday, requests and call-spacing costs.
6. Use stable person ID order for exact ties. This greedy choice is not a proof of a globally optimal schedule.

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

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

Stage: initial. 4 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: 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: 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: 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: target-repair. 1 eligible choices. Selected cost: 97.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 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. 10 eligible choices. Selected cost: 42.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. 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: target-repair. 1 eligible choices. Selected cost: 104.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 4 eligible choices. Selected cost: 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. 10 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. 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: target-repair. 1 eligible choices. Selected cost: 62.00.

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

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

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

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

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

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

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

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

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

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

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

Stage: initial. 8 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: target-repair. 1 eligible choices. Selected cost: 54.50.

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

Stage: initial. 4 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: target-repair. 1 eligible choices. Selected cost: 82.00.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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