[1] K.R. Baker, Scheduling a full-time workforce to meet cyclic staffing requirements, "Management Science", 20, 1974, pp. 1561-1568.

[2] J.J. Bartholdi III, A guaranteed-accurancy round-off algorithm for cycling scheduling and set covering, "Operations Research", 29, 1981, pp. 501-510.

[3] J.J. Bartholdi III, J.B. Orlin, and H.D. Ratliff, Cycling scheduling via integer programs with circular ones, "Operations Research", 28, 1980, pp. 1074-1085.

[4] T.E. Bartlett, An algorithm for the minimum number of transport units to maintain a fixed schedule, "Naval Research Logistics", 4, 1957, pp. 139-149.

[5] S.E. Bechtold, Work-force scheduling for arbitrary cyclic demands, "Journal of Operations Management", 1, 1981, pp. 205-214.

[6] R.E. Burkard, Optimal schedules for periodically recurring events, "Discrete Applied Mathematics", 15, 1986, pp. 167-180.

[7] W. Dauscha, H.D. Modrow, and A. Neumann, On cyclic sequence types for constructing cyclic schedules, "Zeit. F. Oper. Res.", 29, 1985, pp. 1-30.

[8] S. French, Sequencing and Scheduling, Ellis Horwood, Chichester, 1982.

[9] J. Gertsbach and Y. Gurevich, Constructing an optimal fleet for a transportation schedule, "Transportation Science", 11, 1977, pp. 20-36.

[10] W.L. Hsu, On the general feasibility test of scheduling lot sizes for several products on one machine, "Management Science", 29, 1983, pp. 93-105.

[11] V.B. Klats, An exact optimal cycling scheduling algorithm for multioperator service of a product on line, "Automat. Remote Control", 43, 1982, pp. 538-542.

[12] E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan (eds.), The Traveling Salesman problem, John Wiley & Sons, Chichester, 1985.

[13] J.B. Orlin, Minimizing the number of vehicles to meet a fixed periodic schedule: an application of periodic posets, "Operations Research", 30, 1982, pp. 760-776.

[14] K.S. Park and D.K. Yun, Optimal scheduling of periodic activities, "Operations Research", 33, 1985, pp. 690-695.

[15] A.H.G. Rinnooy Kan, Machine Scheduling Problems, Martinus Nijhoff, The Hague, 1976.

[16] P. Serafini and W. Ukovich, An approach towards solving periodic scheduling problems, "Ricerca Operativa", 35, 1985, pp. 17-39.

[17] P. Serafini and W. Ukovich, A mathematical model for the fixed-time traffic control problem, "European Journal of Operations Research", 41, 1989, pp. 1-14.

[18] H.S. Stone and P. Sipala, The average complexity of depth-first search with backtracking and cutoff, "IBM Journal of Research and Development", 30, 1986, pp. 242-258.

[19] R.R. Vemuganti, On the feasibility of scheduling lot sizes for two products on one machine, "Management Science", 24, 1978, pp. 1668-1673.