The model of periodic scheduling problem in a production system consists of one machine (service center), n productions and different periodic demands with no backlogging. The existence of feasible schedules are proven under certain conditions. The related methods and algorithms are designed to give several sufficient conditions. Also a searching algorithm is provided as a necessary and sufficient condition. Finally the optimization of periodic schedule to a 0-1 linear program is obtained.