Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 80, Issue -, Pages 11-22Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2016.11.008
Keywords
Scheduling; Preventive maintenance; Release date; Makespan
Categories
Funding
- National Natural Science Foundation of China [71171130, 61473211]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available