scheduling problem 中文意思是什麼

scheduling problem 解釋
等問題
  • scheduling : 編排；調度
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. A comparison of two constraint propagation algorithms and an improved algorithm for disjunctive scheduling problem

    調度問題中兩類分離約束傳播演算法的比較及一種改進演算法
  2. Earliness tardiness job shop scheduling problem

    拖期調度問題的研究
  3. Hybrid genetic algorithm method for identical parallel machine earliness tardiness scheduling problem

    拖后調度問題的混合遺傳演算法方法
  4. Evolutionary strategy method for parallel machine earliness tardiness scheduling problem with common due date

    拖后調度問題的進化策略求解
  5. Application of modified natural number - coded genetic algorithm to vehicle scheduling problem with time windows

    一種改進的自然數編碼遺傳演算法在非滿載時間窗車輛優化調度問題中的應用
  6. The complexity and approximation algorithm of three parallel machines scheduling problem with servers

    帶服務器的三臺平行機排序問題的復雜性和近似演算法
  7. To overcome shortcomings in current efficiency algorithm, genetic algorithm and reverse algorithm existing in non - standard job - shop scheduling problem, a reverse algorithm of solving nonstandard job - shop scheduling problem ( njssp ) based on redundancy was put forward, the mathematical description of njssp was provided, object function was also given simultaneously

    摘要為了克服現有效率演算法、遺傳演算法和逆序演算法等求解非標準作業車間調度問題時存在的不足，提出了一種新的逆序演算法。
  8. When solving the tna problem based on fleet dispatching commands, a stage - assignment algorithm is build to overcome the defect of fifo algorithm, which can be widely applied to cope with fixed job scheduling problem. 3

    在解決基於飛機調度指令要求的飛機排班問題時，本文提出的分階段指派演算法較好地克服了標號演算法的缺陷，該演算法能普遍地應用於處理類似的固定工件排序問題。
  9. Weimin ma, yinfeng xu, jane you, james liu, and kanliang wang. on the k - truck scheduling problem. international journal of foundations of computer science. accepted on 2002

    馬為民王刊良.局內管理決策問題及其競爭策略.管理科學學報. 2002 .錄用待出
  10. Study of multi - machine scheduling problem based on heuristic algorithm

    基於啟發式演算法的并行多機調度問題研究
  11. Study on improvement of heuristic approach for resource - constrained project scheduling problem

    一種實用的啟發式資源平衡優化演算法的改進
  12. Application of improved pseudo - parallel genetic algorithm for job - shop scheduling problem

    一種新的偽并行遺傳演算法在車間調度中的應用研究
  13. And of all scheduling problems, the job - shop scheduling problem ( jsp ) is most common and complicate, which is usually a typical np - complete problem

    本文主要介紹了約束滿足神經網路（ csnn ）在作業車間調度問題（ jsp ）中的應用。
  14. The fourth chapter introduces mas mechanism to construct a dynamic job - shop scheduling system, with ga providing basic support. mas mechanism decomposes a continuous and dynamic job - shop scheduling problem into series of jssps so that the predefined ga can work out the schedule

    在ga提供了求解jssp的有效支持的基礎上，本文引入多代理思想管理車間生產動態過程，以將動態jssp分解為一系列靜態jssp ，從而能通過ga方法求解。
  15. This paper presents an efficient optimization algorithm and complicated code for airciraft landing scheduling problem, based on depth - first - search implicit emumeration algorithm, subject to mps limiting, position lock limiting and optimization depth limiting

    摘要以深度優先搜索的隱枚舉演算法為基礎，結合mps約束、位置凍結限制、優化深度限制，使用復雜的軟體編碼實現了特定於飛機著陸調度問題的優化排序演算法。
  16. 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

    考慮該問題在中斷一恢復和兩種中斷一安裝重復模型下的單機動態排序問題，給出了在這幾種模型下的只考慮當前可用信息的在線調度規則
  17. 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 「 ）的動態在線調度問題，同樣給出了在中斷一恢復和兩種中斷一安裝重復模型下的只考慮當前可用信息的在線調度規則
  18. In this study, we consider the maintenance scheduling problem in a textile company where different maintenance situations exist

    在本研究中，我們考慮一家化纖公司，存在著不同維修情形的維修排程問題。
  19. The wafer probing scheduling problem ( wpsp ) is a variation of the parallel - machine problem, which carries with the objective to minimize the total workload to enhance the utilization rate of machine capacity

    摘要晶圓針測排程問題為平行機臺排程問題的一種，且排程的目標在最小化所有機臺的工作負荷以提高機臺利用率。
  20. However, to minimize the maximum completion time for the wafer probing scheduling problem ( wpsp ) is very important for equally utilizing the capacity of parallel - machine, while satisfying the requirements of product types, product family, sequence dependent setup time, product - type dependent processing time, due dates of jobs, and capacities of machines

    然而求解晶圓針測排程問題最大完工時間的最小化以均勻的利用平行機臺的產能是非常重要的，該問題尚考慮以下的問題特性：產品別與產品族、順序相依設置時間、決定於產品別的工作處理時間、工作交期與機臺產能限制等。
分享友人
分享到 Line

分享到臉書