1. © J. Christopher Beck 20081 Lecture 24: Workforce Scheduling

2. © J. Christopher Beck 2008 2 Outline Bank Personnel Scheduling Demo Shift Scheduling Example 12.3.1 Cyclic Staffing Algorithm 12.4.1 Example 12.4.2 Call Centre Scheduling

3. © J. Christopher Beck 2008 3 Readings P Ch 12.1, 12.3, 12.4, 12.5, 12.7 Questions I Like 12.5a

4. © J. Christopher Beck 2008 4 Workforce Timetabling Arrange shifts and assign people to them Constraints: Number of people per shift Minimum Days off (x/k days must be off) Weekends Nurses, call centres, hotels, restaurants, plane crew, … Bank Demo

5. © J. Christopher Beck 2008 5 Shift Scheduling Fixed cycle Month, week, day Predefined set of shift patterns Each worker is assigned to exactly one pattern Each pattern has its own cost Assign workers to patterns such that Staffing requirements are met and cost is minimized

6. © J. Christopher Beck 2008 6 Example 12.3.1 PatternHoursTotal Hours Cost 110AM – 6PM850 21PM – 9PM860 312PM – 6PM630 410AM – 1PM315 56PM – 9PM316 HourStaff 10AM – 11AM3 11AM – 12PM4 12PM – 1PM6 1PM – 2PM4 2PM – 3PM7 3PM – 4PM8 4PM – 5PM7 5PM – 6PM6 6PM – 7PM4 7PM – 8PM7 8PM – 9PM8

7. © J. Christopher Beck 2008 7 Shift Scheduling Definition m periods b i : # people required in period i n shift patterns n j = (a 1j, a 2j, …, a mj ) = (1, 0, 0, …, 0) a ij = 1: workers on pattern j work period i a ij = 0: workers on pattern j don’t work period i c j : cost of assigning a worker to pattern j x j : # of people assigned to pattern j Length of each period may be different

8. © J. Christopher Beck 2008 8 IP Formulation (see Example 12.3.1) minimize subject to Each period has enough workers Number workers assigned to a pattern is an positive integer or 0 Such an IP is hard unless there is special structure such as having no split shifts

9. © J. Christopher Beck 2008 9 LS Formulation Develop a local search formulation that doesn’t depend on having no split shifts

10. © J. Christopher Beck 2008 10 Apply Your LS to Example 12.3.1 PatternHoursTotal Hours Cost 110AM – 6PM850 21PM – 9PM860 312PM – 6PM630 410AM – 1PM315 56PM – 9PM316 HourStaff 10AM – 11AM3 11AM – 12PM4 12PM – 1PM6 1PM – 2PM4 2PM – 3PM7 3PM – 4PM8 4PM – 5PM7 5PM – 6PM6 6PM – 7PM4 7PM – 8PM7 8PM – 9PM8

11. © J. Christopher Beck 2008 11 A Variation of Example 12.3.1 PatternHoursTotal Hours Cost 110AM – 6PM850 21PM – 9PM860 312PM – 6PM630 410AM – 1PM315 56PM – 9PM316 62PM – 5PM, 7PM – 9PM 535 HourStaff 10AM – 11AM3 11AM – 12PM4 12PM – 1PM6 1PM – 2PM4 2PM – 3PM7 3PM – 4PM8 4PM – 5PM7 5PM – 6PM6 6PM – 7PM4 7PM – 8PM7 8PM – 9PM8 Would you solve this problem with IP or LS?

12. © J. Christopher Beck 2008 12 Cyclic Staffing m period cycle Each period i has requirement b i Each person works k consecutive periods and has the other m – k off c j is the cost of putting a worker on pattern j Find minimum cost schedule

13. © J. Christopher Beck 2008 13 (5,7)-Cyclic Staffing Problem 1001111 1100111 1110011 1111001 1111100 0111110 0011111 Periods Patterns 80701001057590100 3 8 9 11 4 Cost Requirements There are split shifts!

14. © J. Christopher Beck 2008 14 (Different) Special Structure Makes The Problem Easy Solve LP1 (x’ 1,x’ 2, …, x’ n ) If integral, you have optimal Otherwise LP2: LP1 + If integral, you have optimal Otherwise LP3: LP1 + Always integral, so you have optimal

15. © J. Christopher Beck 2008 15 Call Centre Scheduling: Demand time 6AM126PM demand

16. © J. Christopher Beck 2008 16 Call Centre Scheduling: Shift Patterns time 6AM126PM Breaks (moveable)

17. © J. Christopher Beck 2008 17 Solution Framework (Fig 12.4) Select solid tours Place breaksCompare fits Close enough? Modify target demand DONE Y N

18. © J. Christopher Beck 2008 18 Call Centre Scheduling Assign people to shifts to meet the demand and minimize costs It gets worse: workers with different skills! {English}, {English, French}, {French}

19. © J. Christopher Beck 2008 19 Call Centre Scheduling: Demand time 6AM126PM demand English French What do you do with bilingual people?