期刊刊名：南開學報 　 卷期：10卷1期

篇名出版日期：2013年6月1日

作者：楊肅正,郭家源,李新濤,Suh-Jenq Yang,Jia-Yuarn Guo,Hsin-Tao Lee

語言：English

關鍵字：scheduling, maintenance activity, unrelated parallel-machine, total completion time,生產排程,機器維修,非等效平行機台,總完工時間

被點閱次數：6次

閱讀時間：59sec

摘要：
Production scheduling with maintenance planning to improve the production efficiency of machines has received considerable attention over the years. In two recent papers, Wang, Wang, and Liu (2011) and Wang, Huang, Ji, and Feng (2012) studied the scheduling problem in which the n jobs must be scheduled on m parallel unrelated machines with deteriorating maintenance activities to minimize the total completion time. Wang et al. (2011) showed that the problem could be solved in O(n²m⁺³) time and Wang et al. (2012) showed that the problem could be solved in (nm⁺³) if 0＜αij≦1 , where αij＞0 was the modifying rate of job j, if it was assigned to machine i after the maintenance activity was performed. In this note, we proposed a more efficient algorithm and showed that both problems studied by Wang et al. (2011) and Wang et al. (2012) could be solved in (nm⁺³) time even though for the case of αaj＞1 .

　　　　　[全文下載]