| dc.contributor | 資管系 | |
| dc.creator (作者) | 陳春龍 | |
| dc.date (日期) | 2017-11 | |
| dc.date.accessioned | 9-Jun-2026 13:15:21 (UTC+8) | - |
| dc.date.available | 9-Jun-2026 13:15:21 (UTC+8) | - |
| dc.date.issued (上傳時間) | 9-Jun-2026 13:15:21 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=182844 | - |
| dc.description.abstract (摘要) | 流程式排程問題（PFSP)是製造現場常見的問題。因為它在實務上的價值以及計算的複雜度，流程式 排程問題長久以來都是學術界和產業界非常重視的問題。以總完成時間為目標的流程式排程問題 (PFSP- makespan)是研究者最有興趣的問題之一。我從1993就開始該問題的研究，我的兩篇主要的 論文分別刊登在EJOR (1995，在WOS資料庫中被引用118次）和C&IE (1996，在WOS資料庫中被 引用66次）。2011年和2012年國科會計晝的研究成果也以分別刊登在IJAMT (2012), Soft Computing 和Applied Soft Computing。2014年的國科會研究計晝則已開發一個比IGris和DDErls (兩個到目前 為止最好的演算法）為佳的啟發式演算法(BBLS)。本研究計晝有兩個目標:一、持續提升BBLS求解 PFSP- makespan問題的效能；二、延伸BBLS的一些想法，開發新的演算法，求解以總流程時間為目 標的流程式排程問題(PFSP-flowime)。 | |
| dc.description.abstract (摘要) | PFSP with minimum makespan as the objective, denoted as PFSP-makespan, is one of the most studied NP-hard scheduling problems with more than 1000 technical papers focused on solving this problem published in SCI journals in the past decade. I started conducting research on developing metaheuristics to solve PFSP-makespan in 1994, and two of my notable works were published in (1995, cited 118 times in Web of Science) and (1996, cited 77 times in Web of Science). Recently, some of my research on PFSP-makespan (based on my NSC projects in 2011, 100-2221-E-004-004, and 2012, 101-2221-E-004-004) have also been published or accepted by International Journal of Advanced Manufacturing Technology (2012), Soft Computing (2014) and Applied Soft Computing (2014). My current research on PFSP-makespan is supported by NSC in 2014, 103-2221 -E-004-004. We have developed an effective heuristic (block-based local search, BBLS) to solve PFSP-makespan. Computational results show that BBLS is more effective than IGris [8] and DDErls (two of the best heuristics for PFSP-makespan under limited computation times.) The objective of this proposal is two-fold: first, study approaches that may further enhance the performance of BBLS for PFSP-makespan; second, extend the ideas of BBLS to develop new block-based heuristics for PFSP with total flow time as the objective, denoted as PFSP-flowtime. | |
| dc.format.extent | 116 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | 科技部, MOST105-2221-E004-005, 105.08-106.07 | |
| dc.subject (關鍵詞) | 流程式排程問題; 總完成時間; 總流程時間; 啟發式演算法 | |
| dc.subject (關鍵詞) | Permutation Flow Shop Scheduling; Makespan; Total Flow Time; Heuristic | |
| dc.title (題名) | 開發快速鄰近解搜尋法求解以總完成時間和總流程時間為目標的流程式排程問題 | |
| dc.title (題名) | Develop a Fast-Neighbor-Search Method for Solving Pfsp-Makespan and Pfsp-Flowtime | |
| dc.type (資料類型) | report | |
