查詢結果分析
來源資料
相關文獻
- Scheduling Problems on Multiprocessor Systems
- 以多階段遞迴建立重複性工程排程規劃模式
- 最佳化生產技術
- Relative Robustness for Single-Machine Scheduling Problem with Processing Time Uncertainty
- 流程型工廠單產品批量流最佳解與探索解模式之研究
- 零工型工廠以工作為導向的啟發式排程系統之構建
- 根據銷售資料提升啤酒釀造廠生產排程品質之研究
- 智慧型建物能源管理系統於商辦大樓之建置與應用
- A Genetic Optimization Algorithm and Perceptron Learning Rules for a Bi-Criteria Parallel Machine Scheduling
- 社會企業服務創新:有機農業種植排程之服務模式化與系統建置
頁籤選單縮合
題名 | Scheduling Problems on Multiprocessor Systems=多元處理機系統之排程問題 |
---|---|
作者 | 林建福; | 書刊名 | 德明學報 |
卷期 | 11 1996.03[民85.03] |
頁次 | 頁181-205 |
分類號 | 448.5 |
關鍵詞 | 排程; 最佳化; 效能值; Scheduling; Optimization; Performance bound; |
語文 | 英文(English) |
中文摘要 | 多元處理機系統下的排程問題是組合最佳化問題中一個非常重要的課題。一般而言,此問題可被描述如下:在工作性質皆已事先知道的情形下,一組工作如何在能滿足條件限制下而能順利的安排到一群可用的處理機中。排程問題一般可再細分成時間及迫性與非時間及迫性兩大類,本文將只針對非時間及迫性的排程問題做探討。 |
英文摘要 | The problem of scheduling tasks on multiprocessor systems is one of the most rapidly expanding areas of combinatorial optimization. In general, this problem can be described as follows. A given set of tasks is to be processed on a set of available processors, such that all processing constraints are satisfied and a certain objective function is met, under assumption that all tasks' characteristics were known in advance. The scheduling problems have been classified into time-critical scheduling problems and non-time-critical scheduling problems, only scheduling algorithms for the non-time-critical scheduling problems are considered in this paper. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。