A generalization of cyclical work-force scheduling is presented. We compute the minimal number of workers needed for a seven-days-a-week operation to satisfy cyclic demand forDworkers every weekday andEworkers every weekend day, while giving each worker two days off per week, includingAout ofBweekends off, for anyAandB (A < B).Using this workforce, the generalized cyclical scheduling procedure produces a feasible “master rotation” schedule, which additionally maintains all work stretches between two and four days (unless a worker gets two successive weekends off, in which case he works Monday through Friday), and which gives adjacent weekdays off, as often as possible, to any worker who must work on successive weekends. It is shown that the latter condition can be satisfied for all workers in almost all instances.