The Scheduling of Magistrates to Courts
将治安法官排班问题建模为整数规划，但针对特定问题可用启发式方法求解，计算机程序实现后大幅节省文书工作量。
AbstractThe problem of scheduling Magistrates to Courts may be formulated generally as an integer programming problem. However, when a particular problem is considered it is found that heuristic scheduling techniques will produce an acceptable solution to this particular problem without the need to use complex algorithms. The use of a computer program to implement the heuristic scheduling was found to produce a considerable saving in clerical effort.