A relatively simple, analytical model of court scheduling is introduced and analyzed. The model is based on a representation of the process by which cases not disposed of at any appearance are scheduled for another appearance. This representation, although deterministic, possesses many of the important properties of court operations. Using this model, analytical expressions are derived for the number of cases scheduled to appear in each portion of the court each day, the steady-state calendar size in each part, the sizes of future calendars and case backlogs, and the average duration of and the average number of appearances made by each case. In addition, the effect of a dependence of certain processing parameters on the number of cases scheduled is investigated.
Jennings, John B., A Theory of Court Scheduling. Santa Monica, CA: RAND Corporation, 1971. https://www.rand.org/pubs/papers/P4732.html. Also available in print form.
Jennings, John B., A Theory of Court Scheduling, Santa Monica, Calif.: RAND Corporation, P-4732, 1971. As of October 26, 2021: https://www.rand.org/pubs/papers/P4732.html