頁籤選單縮合
題名 | A High-Performing Constructive Heuristic for Minimizing Makespan in Permutation Flowshops= |
---|---|
作者 | Ying, Kuo-ching; Lin, Shih-wei; |
期刊 | 工業工程學刊 |
出版日期 | 20130900 |
卷期 | 30:6 2013.09[民102.09] |
頁次 | 頁355-362 |
分類號 | 494.542 |
語文 | eng |
關鍵詞 | Scheduling; Flowshop; Simple constructive heuristic; |
英文摘要 | Minimizing makespan in permutation flowshops is one of the most frequently investigated problems in scheduling theory. The NEH heuristic is commonly regarded as the best current constructive heuristic for solving this NP-hard problem. In this paper, we propose a novel constructive heuristic with an effective tie-breaking strategy to improve the scheduling quality of this problem. Experimental results reveal that the proposed approach outperforms NEH for all problem sizes on the standard benchmark problem set of Taillard. This study thus appears to successfully demonstrate a high-performing constructive heuristic that can serve as a new foundation for future research on this extremely challenging scheduling problem. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。