%0 Journal Article
%T Scheduling Problem in Multi-resource Emergency Systems Based on the Connection Number<br>基于联系数的多资源应急系统调度问题
%A GAO Shu-ping
%A LIU San-yang
%A <br>高淑萍
%A 刘三阳
%J 系统工程理论与实践
%D 2003
%I 
%X 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.
%K connection number
%K multi-resource emergency systems
%K scheduling problem
%K algorithm<br>联系数
%K 多资源应急系统
%K 调度问题
%K 算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=AFABAD3F6CEADEFF&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=B31275AF3241DB2D&sid=A63576421B012172&eid=EDA22B444205D04A&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=16&reference_num=8