查詢結果分析
來源資料
相關文獻
- 擴充式零工生產排程問題及蟻拓技術為基的求解方法
- Minimizing the Makespan in a Single Machine Scheduling Problem with a Flexible Maintenance
- A Scheduling Problem with Reprocessing Operations--A Case Study
- 以航班組合建立飛機排程模式之研究
- 優勢排程法則在資源限制下專案排程應用之擴充性研究
- 資源限制下之專案優勢排程方法
- 零工型工廠以工作為導向的啟發式排程系統之構建
- A Heuristic Method to Minimize Completion Time Variance on a Single Machine Scheduling Problem
- Makespan Minimization on Identical Parallel Machines Subject to Minimum Total Flow-Time
- 最佳化報廢機車回收場區位途程模式之研究
頁籤選單縮合
題名 | 擴充式零工生產排程問題及蟻拓技術為基的求解方法=Augmented Job Shop Scheduling Problems and an Ant Colony Optimization Technique-Based Solving Method |
---|---|
作者 | 楊烽正; Yang, Feng-cheng; |
期刊 | 國立臺灣大學工程學刊 |
出版日期 | 20050600 |
卷期 | 94 民94.06 |
頁次 | 頁41-54 |
分類號 | 494.542 |
語文 | chi |
關鍵詞 | 蟻拓優化; 零工式生產排程; 擴充式零工生產排程問題; 排程; 啟發式演算法; Ant colony optimization; Job shop scheduling; Augmented job shop scheduling problems; Scheduling; Heuristic searching algorithm; |
中文摘要 | 本文定義一擴充式零工生產排程問題(Augmented JSP, AJSP),並開發求解該類問題的蟻拓優化技術及軟體系統。擴充式零工生產排程問題中,加工步驟間的加工順序限制是複雜的樹狀結構,且考量加工步驟在排程時有多重機器可以選擇且加工所需時間各不相同。本文展示一在個人電腦上執行的蟻拓優化技術為基的工作排程器,名為ACO-JS(Ant Colony Optimization technique-based Job Scheduler),以求解擴充式零工生產排程問題。ACO-JS的求解引擎是蟻拓的排程演算法,本文提示整個詳細的蟻拓求解演算流程。因典型的JSP是AJSP的一個特例,本文也使用ACO-JS求解OR LIB內的典型零工排程標竿問題,並與已發表的文獻比較求解結果。結果顯示蟻拓排程器能有效且較佳地求解包含典型JSP的擴充式AJSP。本文也展示二個擴充式排程問題的範例和求解結果,結果顯示均能求得不錯的解。 |
英文摘要 | This paper presents an augmented job shop scheduling problem and an Ant Colon Optimization technique-based method for solving this problem. The definition and mathematical model of the augmented job shop scheduling problem are rigorously defined and postulated. The presented augmented job shop scheduling problem (AJSP) possesses tree-structured precedence constraints between jobs. In addition, multiple machining choices with various processing times are available in the scheduling process. An ant colony optimization technique-based job scheduler, namely ACO-JS, is presented for solving AJSPs. This paper presents the job scheduling algorithm used by an ant to construct a feasible solution. Since classic JSPs are trivial cases of A JSPs, benchmark problems from JSP LIB were tested and compared with results from literature. Results show that ACO-JS can solve classic JSPs in a better performance level than others. Two designed augmented JSPs with different tree-structured precedence constraints are used to test the proposed method. Results show that although ACO-JS can not achieve the global optimal schedule, the solving capability can still generated acceptable schedules within a short period of time. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。