Scheduling Problem in Multi-resource Emergency Systems Based on the Connection Number
基于联系数的多资源应急系统调度问题

The time from retrievel depots to emergency depot in multi-resource emergency systems scheduling problem is uncertain. In this paper, the above problem is described and solved by using the connection numbers of the Set Fair Analysis theory for the first time. The order relation of connection numbers is defined. The model and algorithm of the earliest emergency-start-time are proposed based on the connection number in multi-resource emergency systems. An example illustrates that the algorithm is effective and feasible.