Work Force Size and Single Shift Schedules with Variable Demands

Abstract

In recent years, labour negotiations for seven-day-week organizations such as hospitals, mining companies and chemical industries have seen an increased emphasis on improving shift schedules. This paper gives an exact lower bound on the number of workers required to satisfy such primary contractual commitments as ensuring that each employee receives at least A out of every B weekends off, everyone works exactly five days per week, and no one works more than six consecutive days. The model addressed is general in that it allows the number of workers required each day to vary. The proof that the bound is the best possible is constructive. A linear time algorithm is presented that generates schedules satisfying all the primary objectives. Extensions discuss means of incorporating secondary objectives such as giving pairs of adjacent days off.labor, organizational studies: manpower planning, production/scheduling

Nurse rostering: models and algorithms for theory, practice and integration with other problems

“…Inspired by Burns and Carter [27], a lower bound on the number of nurses required for problem P 1 can be calculated using parameters a and d j (Equation (2.4)).…”

Operating Hours, Working Times and Employment in the Netherlands

“…a minimum number of employees are needed (see e.g. Burns and Carter, 1985). This may explain why shift work is more frequent in larger establishments (Anxo et al, 1995).…”

Combining rules and constraints for employee timetabling

“…12 They give an algorithm to construct a weekly schedule which minimizes work-force requirements under varying daily loads. They do not consider the assignment problem for individual workers, which is the main issue in the present article.…”