查詢結果分析
來源資料
相關文獻
- A Pareto-Optimal Solution Procedure for the Single-Machine Scheduling Problem with Release Time and Multiple Performance Measures
- 以最大延遲時間為準則之單機群組排程問題
- 禁忌搜尋法在彈性零工型製造系統排程之探討
- Single Machine Scheduling with Due Dates and Class Setups
- Performance Evaluations with Arbitrary Transceiver Tuning Latencies in Passive Star-coupled DWDM Networks
- 整備與拆卸時間考量之開放型排程問題之求解模式建立
- Two- and Three-Machine Flowshop Scheduling Problems with Optional Final Operation
- 零工型工廠以工作為導向的啟發式排程系統之構建
- A Heuristic Algorithm to Minimize Total Weighted Tardiness on a Single Machine with Release Dates and Sequence-Dependent Setup Times
- 應用霍普菲爾-坦克類神經網路於單機排程延遲時間與整備時間最小化之研究
頁籤選單縮合
題 名 | A Pareto-Optimal Solution Procedure for the Single-Machine Scheduling Problem with Release Time and Multiple Performance Measures=針對具釋放時間與多績效衡量單機排程問題之Pareto最佳解程序 |
---|---|
作 者 | 陳威仰; 沈國基; | 書刊名 | 工業工程學刊 |
卷 期 | 28:5 2011.07[民100.07] |
頁 次 | 頁346-359 |
分類號 | 494.5 |
關鍵詞 | 排程; Pareto最佳解; 早交時間; 延遲時間; 延遲作業; Scheduling; Pareto-optimal; Earliness; Tardiness; Tardy jobs; |
語 文 | 英文(English) |
英文摘要 | This study investigates a single-machine scheduling problem with release times. The objective is to minimize the summation of the weighted earliness and tardiness, subject to the number of tardy jobs. The given n jobs with different earliness and tardiness weights have different release times but the same due date. An algorithm is proposed to efficiently generate Pareto-optimal solutions for any possible number of tardy jobs. The accuracy and run time of our algorithm are discussed. In addition, the results show that the proposed algorithm can eliminate most nodes in the branching tree to efficiently find solutions. |
本系統中英文摘要資訊取自各篇刊載內容。