Abstract
In organizations where duty is around the clock, seven days a week and every week of the year, timetabling is a very difficult task, juggling between the workload and the constraints to be respected. Our work concerns cyclical timetabling. This is not just duplicating a fixed sequence of assignments, but has to consider fixed annual leave, and various regulations on assignments on successive days. In some cases, the cycle sequence has to be relaxed and cycle length shortened or extended. In other cases, a small change in leave dates is allowed, except in summer. This paper describes the context and the use of work cycles in the real world, proposes an abstract model to take into account the various constraints, and finally shows how to implement an effective solution using constraint logic programming (in particular, CHIP V5) to produce timetables of up to 150 people over a yearly horizon.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beldiceanu, N., Contejean, E.: Introducing Global Constraints in CHIP. J. Math. Comput. Modell. 20 (1994) 97–123
Chan, P., Kamel, H. Weil, G.: Nurse Scheduling with Global Constraints in CHIP: GYMNASTE. Practical Applications of Constraint Technology (1998)
Darwin, S., Sabah, U.R.: Nurse Scheduling Models: A State-of-the-Art Review. J. Soc. Health Syst. 2 (1990) 62–72
Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The Constraint Handling Language CHIP. Proc. Int. Conf. on Fifth Generation Computer Systems (FGC’88, Tokyo) (1988) 693–702
Hung, R.: Multiple-Shift Workforce Scheduling under the 3-4 Workweek with Different Weekday and Weekend Labor Requirements. Manage. Sci. 40 (1994) 280–284
Jarrah, A.I.Z., Jonathan, F.B., Anura, H.S.: Solving Large-scale Tour Scheduling Problems. Manage. Sci. 40 (1994) 1124–1144
Laporte, G., Norbert, Y., Biron, J.: Rotating Schedules. Eur. J. Oper. Res. 4 (1980) 24–30
Laporte, G.: The Art and Science of Designing Rotating Schedules. J. Oper.Res. Soc. 50 (1999) 1011–1017
Mackworth, A.K.: Consistency in Networks of Relations. Artif. Intell. 8 (1977) 99–118
Weil, G., Heus, K., Puget, F., Poujade, M.: Solving the Nurse Scheduling Problem Using Constraint Programming. IEEE Eng. Med. Biol. July-August (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, P., Weil, G. (2001). Cyclical Staff Scheduling Using Constraint Logic Programming. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42421-5
Online ISBN: 978-3-540-44629-3
eBook Packages: Springer Book Archive