A mathematical study of a time-sharing system with a single server and many queues. In each queue a customer receives one quantum of service and is then sent to the end of the next queue, provided his service demand has not been completely satisfied. When a quantum of service is completed, the server attends to the first customer in the lowest-index nonempty queue. Mathematical expressions for the main performance measures are derived and illustrated by graphical means.