請使用永久網址來引用或連結此文件:
https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/122972
|
| 題名: | Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities |
| 作者: | Cheng, Chen-Yang;Ying, Kuo-Ching;Chen, Hsia-Hsiang;Lin, Jia-Xian |
| 關鍵詞: | Scheduling;Proportionate permutation flowshop;Variable maintenance activities;Optimization algorithm |
| 日期: | 2018-03 |
| 上傳時間: | 2023-04-28 16:33:12 (UTC+8) |
| 出版者: | Elsevier Ltd. |
| 摘要: | Proportionate permutation flowshop (PPF) is a class of flowshop problems that has appeared in the literature since the early 1980s. However, no research has been conducted on PPF with variable maintenance activities (VMAs). To remedy this research gap, this study proposed optimization algorithms for six PPFs with equal- and unequal-duration VMAs, aiming to minimize their total completion time, maximum lateness, and maximum tardiness, respectively. All the problems studied here were optimally solved in polynomial times using the proposed algorithms. Accordingly, the proposed optimization algorithms could be applied by decision-makers in actual PPF scheduling environments. |
| 關聯: | Computers & Industrial Engineering 117, p.164-170 |
| DOI: | 10.1016/j.cie.2018.01.027 |
| 顯示於類別: | [資訊工程學系暨研究所] 期刊論文
|
文件中的檔案:
| 檔案 |
描述 |
大小 | 格式 | 瀏覽次數 |
|---|
| index.html | | 0Kb | HTML | 99 | 檢視/開啟 |
|
在機構典藏中所有的資料項目都受到原著作權保護.
|