期刊
COMPUTERS & OPERATIONS RESEARCH
卷 80, 期 -, 页码 11-22出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2016.11.008
关键词
Scheduling; Preventive maintenance; Release date; Makespan
类别
资金
- National Natural Science Foundation of China [71171130, 61473211]
This paper addresses the production scheduling problem on a single machine With flexible periodic preventive maintenances (PM), where jobs' release dates are also considered. Both resumable and non-resumable cases are studied. For the resumable case, it is proved that the problem can be solved in polynomial time with Earliest Release Date (ERD) rule. For the non-resumable case, it is proved to be NP-Hard in strong sense. And, a mixed integer programming (MIP) mathematical model is provided. Then, an effective heuristic ERD-LPT based on the properties of optinlal solution is proposed. Meanwhile, a branch and-bound algorithm (B and B) that utilizes several dominance rules is developed to search the optimal schedule for small-to-medium sized problems. Computational results indicate that the proposed heuristic is highly accurate and the two algorithms are complementary in dealing with different sized problems. Furthermore, the improvement of the integration between production scheduling and PM is significant compared with the First-in-First-out (FIFO) rule which is adopted commonly in industry. (C) 2016 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据