Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities
學年 106
學期 2
出版（發表）日期 2018-03-01
作品名稱 Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities
作品名稱（其他語言）
著者 Chen-Yang Cheng; Kuo-Ching Ying; Hsia-Hsiang Chen; Jia-Xian Lin
單位
出版者
著錄名稱、卷期、頁數 Computers & Industrial Engineering 117, p.164-170
摘要 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.
關鍵字 Scheduling;Proportionate permutation flowshop;Variable maintenance activities;Optimization algorithm
語言 en
ISSN 1879-0550; 0360-8352
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度 是
國別 GBR
公開徵稿
出版型式 ,電子版,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/122972 )