Article ID: | iaor19941708 |
Country: | Singapore |
Volume: | 8 |
Issue: | 2 |
Start Page Number: | 189 |
End Page Number: | 201 |
Publication Date: | Nov 1991 |
Journal: | Asia-Pacific Journal of Operational Research |
Authors: | Panton David M. |
Keywords: | scheduling |
Computational procedures for creating multiple shift cyclic rosters under very general workforce conditions are presented. The paper describes the use of a modular approach for the creation of single shift schedules, subject to specified workforce requirements and off weekend cycles. Methods for assigning shifts to days worked using either integer programming or network models are then discussed. The method described can be applied to a variety of work week structures from 40 hour to 36 hour week schedules, and for a wide range of user specified union and quality constraints. The application of the method to the creation of a cyclic roster for a 38 hour week involving 40 personnel is used as an illustration.