A Theory of Court Scheduling,

Abstract

A relatively simple, analytical model of court scheduling (calendaring) 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 (the calendar size) 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.

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1971
Accession Number
ADA001981

Entities

People

  • John B. Jennings

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Engineering
  • Scheduling (Production)
  • Steady State

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Control Systems Engineering.
  • Logistics and Supply Chain Management.