machine scheduling 中文意思是什麼

machine scheduling 解釋
編制機床作業進度表
  • machine : n 1 機（器），機械；機關，機構。2 印刷機器；縫紉機；打字機；汽車；自行車；三輪車；飛機；〈美俚〉...
  • scheduling : 編排；調度
  1. Study of multi - machine scheduling problem based on heuristic algorithm

    基於啟發式演算法的并行多機調度問題研究
  2. Fourthly, we use the two models to study the dynamic single - machine scheduling problem prmp fmax and develop on - line optimal dispatching rules, which consider only available information

    考慮該問題在中斷一恢復和兩種中斷一安裝重復模型下的單機動態排序問題，給出了在這幾種模型下的只考慮當前可用信息的在線調度規則
  3. Fifthly, we use the two models to study the dynamic single - machine scheduling problem rj, chains, prmp wj ( 1 - e - acj ) and develop on - line optimal dispatching rules, which consider only available information

    R ， ， prec ， pr呷}藝瑪（ l一。一ac 「 ）的動態在線調度問題，同樣給出了在中斷一恢復和兩種中斷一安裝重復模型下的只考慮當前可用信息的在線調度規則
  4. In this paper we review the new development of scheduling in practice, espacially the machine scheduling with material handling device ( the robotic cell scheduling problem, the automated guided vehicles scheduling problem etc. ) and the hoist scheduling problem

    對排序問題的研究在實際應用中的新發展，特別是具有材料搬運裝置的機器排序問題和抓鉤排序問題作了綜述。
  5. The paper investigats modeling and optimizing problems of parallel machine scheduling with resource - constrained and multi - step working procedure, acting bell - type annealing of shanghai baosteel yichang sheet lt. co. as practical background, designs and develops scheduling production system which is optimized according to practical demand of annealing workshop

    本文以上海寶鋼益昌薄板有限公司罩式爐退火過程為背景，研究了資源受限多步工序并行機器調度問題的建模和優化問題，結合退火爐車間生產調度的實際需要，進行了退火爐優化排產系統的設計和開發。
  6. According to the number of processors, scheduling problem can be grouped as single - machine scheduling problem and multi - machine scheduling problem. according to whether the job ' s processing time, released time and the surroundings of the processors are deterministic or stochastic, scheduling problem can be grouped as deterministic scheduling problem and stochastic scheduling problem. according to whether the parameters of the jobs are given before - hand, scheduling problem can be grouped as static scheduling problem and dynamic scheduling problem

    按處理機個數將排序問題分為：單機排序問題和多處理機排序問題；根據任務加工時間和到達時間以及處理機的工作環境等數據是確定的或服從某種隨機分佈可分為：確定性排序問題和隨機排序問題；根據所有任務的參數是否是預先給定的可分為：靜態排序問題和動態排序問題。
  7. As an example, the parallel machine scheduling problem is mapped on a non - constrained matrix construction graph, and a aco algorithm is proposed to solve the parallel machine scheduling problem. comparison with other best - performing algorithm, the algorithm we proposed is very effective. the finite deterministic markov decision process corresponding to the solution construction procedure of aco algorithm is illustrated in the terminology of reinforcement learning ( rl ) theory

    本章最後提出了解決并行機調度問題的蟻群演算法，該演算法把并行機調度問題映射為無約束矩陣解構造圖，並在演算法的信息素更新過程中應用了無約束矩陣解構造圖的局部歸一化螞蟻種子信息素更新規則，與其他幾個高性能演算法的模擬對比試驗證明這種方法是非常有效的。
  8. Thirdly, integrating bell - type scheduling investigation of domestic and overseas documents, the paper defines optimized scheduling production of bell - type annealing process as the problem of parallel machine scheduling with resource - constrained and multi - step working procedure, whose optimized function of objective function is given also. furthermore, the author constructs bell - type optimized scheduling model by means of the way combing discrete event simulation with algorithm of intelligent optimization

    本文在綜合國內外對于罩式爐調度研究的基礎上，將罩式爐退火過程優化排產定義為資源受限多步工序并行機器調度問題，並定義了優化目標評價函數；將面向對象的離散事件建模模擬方法和智能優化方法相結合建立了退火爐優化排產模型。
  9. Single machine scheduling with precedence constraints and processing time dependent on starting time

    具有優先約束和加工時間依賴開工時間的單機排序問題
  10. In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems, one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio, another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan, we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1. 6

    第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。
  11. Thirdly, we use the two models to study the dynamic single - machine scheduling problem prmp and develop on - line optimal dispatching rules, which consider only available information

    西北工業大學碩士論文摘妥第四，我們研究了一般費用函數問題1 } r ， ， prmp } fma 、的動態在線排序問題
  12. Ordering on - line and semi on - line algorithm for single machine scheduling

    單臺機訂單排序的在線與半在線演算法
  13. A semi - online algorithm for parallel machine scheduling on three machines

    三臺平行機排序的一個復合半在線問題的演算法
  14. The single machine scheduling problem with continuous resources was discussed

    摘要討論具有連續資源的單機排序問題。
  15. Modeling and analysis of single machine scheduling based on noncooperative game theory

    單機調度的非合作博弈建模與分析
  16. Fuzzy single machine scheduling problem with mixed precedence constraints and fuzzy due dates

    基於圖論的帶模糊約束最小費用與最小時間問題
  17. Single - machine scheduling with maintenance to minimize the total weighted completion time

    目標函數為加權完成時間和的單機維護調度問題研究
  18. Parallel genetic algorithm for solving identical parallel machine scheduling problem with constraint

    用并行遺傳演算法解決帶約束并行多機調度問題
  19. A survey for the progress of semi on - line algorithms on parallel machine scheduling problems is made

    摘要對半在線平行機排序問題的研究進展作了詳細綜述和進一步探討。
  20. This paper continues to survey the progress on semi on - line algorithms on parallel machine scheduling problems and studies the relation between different semi on line scheduling problems

    摘要繼續介紹半在線平行機排序問題的研究進展。主要介紹第二類、第三類半在線模型。研究兩個（或兩個以上）半在線模型間關系：復合與限制。文章最後給出了一些待研究的問題。
分享友人
分享到 Line

分享到臉書