Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. This article provides a classification of the main constraint classes governing the design of rotating schedules. A constraint programming algorithm is developed and tested on several real-life examples. Computational results confirm the efficiency and robustness of the proposed approach.