近似最優配置 的英文怎麼說

中文拼音 [jìnzuìyōupèizhì]
近似最優配置 英文
approximating optimum allocation
  • : Ⅰ形容詞1 (空間或時間距離短) near; close 2 (接近) approaching; approximately; close to 3 (親...
  • : 副詞(表示某種屬性超過所有同類的人或事物) most; best; worst; first; very; least; above all; -est
  • : Ⅰ動詞1 (兩性結合) join in marriage 2 (使動物交配) mate (animals) 3 (按適當的標準或比例加以...
  • : 動詞1. (擱; 放) place; put; lay 2. (設立; 布置) set up; establish; arrange; fix up 3. (購置) buy; purchase
  • 近似 : approximate; similar; approach; approximation; roughness; propinquity
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 配置 : dispose (troops, etc. ); deploy; allocation; collocation; configuration; positioning; allotment
  1. 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 )分派規則,先將參加排序的工序合併成一個串列序列,然後按照同層內不存在偏序關系的原則,將其分解為若干個時間上相互銜接的層次,在每個層次內部,通過構造鄰域產生出多個可行序列,對每個可行序列進行設備,採用鄰域搜索演算法進行方案的尋,保留一組滿足評價要求的可行方案作為下一層設備的背景環境,通過層層遞進終獲取全局的解。
分享友人