查詢結果分析
相關文獻
- Fast Heuristic Algorithm for Scheduling n Operations on m Machines (A Comparison with Mathematical Programming Models)
- Scheduling for Parallel Machines Systems
- 零工型工廠以工作為導向的啟發式排程系統之構建
- A Heuristic Algorithm to Minimize Total Weighted Tardiness on a Single Machine with Release Dates and Sequence-Dependent Setup Times
- 產能衝刺階段電子元件廠投料數學規劃模式之實例應用
- 以遺傳演算法為基礎之二部機器以上排序法之最佳化
- 特殊假期鐵路列車排程規劃之分析模式
- 不同釋放時間工作在單機上加工的加權延遲件數排程問題之研究
- Minimizing the Makespan in a Single Machine Scheduling Problem with a Flexible Maintenance
- A Scheduling Problem with Reprocessing Operations--A Case Study
頁籤選單縮合
題 名 | Fast Heuristic Algorithm for Scheduling n Operations on m Machines (A Comparison with Mathematical Programming Models)=n個作業於m部機器上排程之快速啟發式解法(與數學規劃模式做一比較) |
---|---|
作 者 | 俞凱允; | 書刊名 | 明志工專學報 |
卷 期 | 27 1995.05[民84.05] |
頁 次 | 頁169-188 |
分類號 | 494.542 |
關鍵詞 | 啟發式; 工作場; 數學規劃; 排程; Heuristic; Job shop; Mathematical programming; Scheduling; |
語 文 | 英文(English) |
中文摘要 | 此文展示了一個快速的啟發式模式用以求解安排工作場中n個作業於m部機器上之排程問題,其對等之數學規劃模式用於兩種不同的準則下,即最短完成時與最短製程範圍,以求解安排工作場中n個作業於m部機器上之排程問題亦於此文中展示。結果顯示出運用此快速啟發式模式所求得之排程幾乎與數學規劃模式所求得之最佳排程相差無幾。這些不同的模式之間亦做了一番比較。文中並以安排七個作業於兩部機器上之排程問題為例作說明。 |
英文摘要 | In this paper, a fast heuristic algorithm for solving the problem of scheduling n operations on m machines in a job shop was developed. The mathematical programming models for solving the problem of scheduling n operations on m machines in a job shop under two different criteria, minimum completion time and minimum makespan, wee also presented. It is how that by applying the fast heuristic algorithm, the resulting schedule is fairly near the optimal schedule obtained by the mathematical programming models. Some comparisons were also made among these models. A seven operations, two machines example is illustrated. |
本系統中英文摘要資訊取自各篇刊載內容。