Scheduling with list processing and problem oriented data structures

A set-processing algorithm for scheduling staff on 4-day or 3-day work weeks

“…In the second pass, we search for exchanges that will improve the schedule for one party without harming the schedule for the other. With E 1 (1,15) (3,11) and E 2 (4, 12) we reduce 1-day work stretches for both parties but do leave a single day work stretch for employees 11 and 12. With E 3 (7,13), E 3 (8,14), E 4 (9, 19), and E 4 (10, 20) we eliminate single day work tours for both parties in each exchange.…”

“…As advocated by Mack and Smith [11], we construct the scheduling algorithm in a list processing framework. First define T s (r) as the subset of employees in set s that have yet to be assigned their rth additional day off this week, where r Å 1, (2), and T 4 (3).…”