基于联系数的多资源应急系统调度问题

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.