dispatching sequence 中文意思是什麼

dispatching sequence 解釋
調度順序
  • dispatching : 調度,配送
  • sequence : n 1 繼續;接續;連續。2 順序;程序;次第;關系;關聯。3 後果;結果;接著發生的事;後事;後文。4 ...
  1. This paper describes a series of preliminary results in combination with actual situations of hydropower development in dadu river by means of establishing river basin water rainfall regime monitoring network, carrying out multi - link large system comprehensive dispatching study of water, electricity and network in group reservoirs, conducting the control mode study of cascade hydropower stations, power supply range and development lime sequence, planning environmental impact assessment in a river basin, as well as the dispatching patching of gongzui, tongjiezi cascade hydropower stations

    大渡河流域水電開發有限公司結合流域水電開發實際,通過建立流域水雨情監測網,開展群庫水、電、網多環節的大系統綜合調度研究,流域梯級電站控制模式研究、流域供電范圍及開發時序研究,流域規劃環境影響評價研究,以及龔嘴、銅街子電站梯級調度實踐,在流域梯級電站統一調度研究方面已取得了初步的成果。
  2. The software communicates with the dispatch server via a set of interface functions. the sequence charts of the commanding and dispatching services, such as call control, monitoring, short messages are given referring to tetra air interface protocol

    調度臺軟體通過一組介面函數與調度服務器進行信息交互,參考tetra空中介面協議,本文給出呼叫控制、監聽、短消息等指揮調度業務的消息順序圖。
  3. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先( ect )分派規則,先將參加排序的工序合併成一個串列序列,然後按照同層內不存在偏序關系的原則,將其分解為若干個時間上相互銜接的層次,在每個層次內部,通過構造鄰域產生出多個可行序列,對每個可行序列進行設備配置,採用鄰域搜索演算法進行方案的尋優,保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境,通過層層遞進最終獲取全局的近似最優解。
分享友人