查詢結果分析
相關文獻
頁籤選單縮合
題 名 | Sequencing Heuristic for Scheduling Jobs with Periodic Maintenance |
---|---|
作 者 | Chen, Wen-jinn; Tsou, Jia-chi; | 書刊名 | International Journal of Information and Management Sciences |
卷 期 | 19:4 2008.12[民97.12] |
頁 次 | 頁635-649 |
分類號 | 494.542 |
關鍵詞 | Scheduling; Maintenance; Total flow time; Tardy job; |
語 文 | 英文(English) |
英文摘要 | In this paper we consider a scheduling problem where the limited availability of machine results from maintenance. In many manufacturing systems, scheduling maintenance will result in some jobs being tardy and a larger total flow time is generated. Therefore, our objective is to find a schedule that minimizes the total flow time subject to minimum number of tardy jobs and periodic maintenance. In this paper, a branch-and-bound algorithm that utilizes several theorems is proposed to derive the optimal schedule. We also develop a heuristic to solve large sized problems. Computational results show that the presented heuristic is highly accurate and efficient. |
本系統中英文摘要資訊取自各篇刊載內容。