preemptive algorithm 中文意思是什麼
-
For the non - preemptive version, we present a new lower bound 6 5 which improves the known lower bound 1. 161. for the preemptive version, we present an optimal semi - online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5 4 otherwise, while a lower bound 1. 0957 is also presented for general case
本文的主要結果為：對不可中斷的情況，我們給出了該問題的下界是6 5 ，從而改進了文獻中的給出的結果1 . 161 .對可中斷的情況，所謂工件加工允許中斷，即加工過程中允許機器暫停某工件的加工，而改為加工另一工件。 -
The hrslbf consists of load balancing algorithm and preemptive process migration mechanism
Hrslbf框架由基於多種資源的負載平衡演算法lbmr和搶占式進程遷移機制組成。 -
A deeper form of obfuscation uses overload induction, a patented algorithm devised by preemptive solutions
更深層的模糊處理形式是使用重載歸納，這是一種由preemptive solutions創造的專利演算法。 -
First we give some notations : where r lti : the load of the machine at step t ( i. e., immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; …, jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1, …, pn, there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3. 2. 1 ) the algorithm will schedule jobs in such a way that, at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3. 2. 1 ) step 2 research the following reserved intervals
需加工n個工件人； … ；人，每個工件是在線到達（ oneb ， olle ）且可打斷的，機器人人的準備時間為az ，怎樣安排加工順序，使工件的最大完工時間（ makespan ）盡可能地小，稱此問題為帶機器準備時間的平行機在線排序問題。它是帶機器準備時間的平行機排序和平行機在線排序問題的綜合和推廣；具有廣泛的應用背景。這里工件在線到達（ onebyone ）指的是工件的情況並不是提前知道的，只有將工件jj人安排完以後我們才能知道工jj的一些情況p工件的加工時間p 。
分享友人