服务窗口排序与应急管理研究

Studying on the Scheduling of Service Window and Emergency Management

研究带服务等级的平行机离线排序问题以及服务窗口应急管理与策略问题。目标是极小化所有工件的最大完工时间,即makespan。对带服务等级约束的平行机排序问题的一般情形,通过0-1整数规划建立了该问题的基本模型。对服务窗口应急管理问题,可以将问题转换为平行机排序问题。在达到本文所定义的客户满意度条件下,对临时增设多个服务窗口情况进行客户队列调度安排,并进行模型建立和算法设计。

In this paper, the authors study the parallel machine scheduling problem with a grade of service（GOS） and the scheduling problem of emergency management service. The objective is to minimize the last client＇s completion time. The authors establish a general model for the scheduling problem of parallel machines with GOS by 0-1 integer programming. For the scheduling of emergency management service, it can be changed to a parallel machine scheduling. The authors consider the model and the design of algorithm for the scheduling of emergency management service in order to achieve the defined customer satisfaction.