An Annotated Bibliography of Personnel Scheduling and Rostering
Annals of Operations Research
Computational methods for rostering and personnel scheduling has been a subject of continued research and commercial interest since the 1950s. This annotated bibliography puts together a comprehensive collection of some 700 references in this area, focusing mainly on algorithms for generating rosters and personnel schedules but also covering related areas such as workforce planning and estimating staffing requirements. We classify these papers according to the type of problem addressed, the
... ication areas covered and the methods used. In addition, a short summary is provided for each paper. Workforce planning is more about strategic decisions than operational ones. It involves the determination of the staff levels required if an organisation is to achieve its goals. As ANNOTATED BIBLIOGRAPHY 29 an example, a workforce planning problem for airlines is to decide how many pilots will be employed. Task assignment is the process of allocating a set of tasks, with specified start and end times and skill requirements, between a group of workers who have typically already been assigned to a set of working shifts. Crew rostering is largely applied in transportation systems. The optimal duties obtained from crew scheduling are sequenced, in some optimal fashion, to form feasible lines of work. Crew rostering is then the process of choosing a set of the best lines of work for all employees. Tour scheduling in non-transportation systems is similar to crew rostering. A non-linear mathematical programming model is used to transform refuse tonnage for each day of the week into a requirement for trucks and therefore staffing levels. . Notes. The problem of creating rosters for aircraft refuelling staff at airports in Spain is presented together with a heuristic algorithm for creating good solutions. The problem is characterised by variable demand and relatively flexible shift times though shifts are categorised into three types. The planning horizon can be short term (one week) through to long term (whole year with given leave blocks). The solution method proceeds in three phases: first all feasible weekly patterns of night, morning, evening and rest shifts are generated and from these a suitable subset covering demand are selected. Next these worklines are assigned to staff. Finally actual shifts are assigned to each day.