研究在紧急情况发生时,城市中不同交巡警服务平台的警务人员封锁指定区域的最优调度问题.把交巡警服务平台到达指定要道的时间视为满足正态分布的随机变量,从而建立了满足机会约束的警务调度模型并将该模型等价地转化为极小极大模型.给出了模型的求解算法及其计算复杂度.最后,通过一个数值例子来说明算法的有效性. In the case of an emergency, the optimal dispatch problem of the designated area is blocked by police officers of different CCTV service platforms in the city, and the time when the Patrol service platform reaches the designated aisle is regarded as a random variable satisfying the normal distribution, so as to establish The police scheduling model which satisfies the chance constraint is transformed into the maximal maximal model equivalently.The model solving algorithm and its computational complexity are given.Finally, a numerical example is given to illustrate the effectiveness of the algorithm.