time bound processing 中文意思是什麼
time bound processing
解釋
時間界限處理-
Regard market demand as the aim, henda company carries on product development with the newest thechnology at present of the same trade in the world. in order to gurantee the technology leading posit on of products, and keeping the high senstivity to the technical development, the company is closely bound up with the same trade in the world to follow the development trend and technology of food processing in time. we have every reason to believe that through the efforts of technical staff, hen da company will have a brighter future and offer the advanced meat processing equipment and better service for market and customers
以市場需求為龍頭，以當今世界同等業最新技術為手段，是諸子百家企業進行產品開發的特點.為保證產品技術依靠地們和企業以技術發展的高靈敏度，公司密切保持與國外同等的聯系，了解當今世界食品加工的發展趨勢和技術.為市場提供先進的肉類加工設備.相信經過亨齊達企業技術人員的努力，公司將有更大的作為為廣大客戶服務 -
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 。
分享友人