scholarly journals Improved Approaches to Minimize the Makespan on Single-Machine Scheduling with Periodic Preventive Maintenance Activities

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Hongming Zhou ◽  
Ya-Chih Tsai ◽  
Ful-Chiang Wu ◽  
Shenquan Huang ◽  
Fuh-Der Chou
Keyword(s):  
Single Machine ◽  
Preventive Maintenance ◽  
Bin Packing ◽  
Heuristic Algorithms ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Mixed Integer ◽  
Mip Model ◽  
Periodic Preventive Maintenance ◽  
Maintenance Activities

This paper addresses a single-machine scheduling problem with periodic preventive maintenance activities that are predeterministic so that the machine is not available all the time, and jobs have to be processed between two consecutive maintenance periods. We propose a mixed integer programming (MIP) model and two heuristics to minimize the makespan. With more constraints in our model, the model is more efficient than the recent model of Perez-Gonzalez and Framinan , and our model could solve problems with up to fifty jobs. Two heuristic algorithms, namely, H (MW) and H (LB∗), are also proposed, in which two bin-packing policies of the minimum waste and minimum lower bound are used, respectively. Furthermore, we also proposed an improvement procedure. The results showed that the heuristic H (MW) outperformed other heuristics of the paper, indicating that the bin-packing policy of the minimum waste is more effective than well-known ones such as full batch and best fit. Additionally, all the heuristic algorithms addressed in this paper combined with the improvement procedure could achieve a similar and high quality of solutions with a very tiny increase in computational expense.

scholarly journals Single-Machine Scheduling with Fixed Periodic Preventive Maintenance to Minimise the Total Weighted Completion Times

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Hongming Zhou ◽  
Ya-Chih Tsai ◽  
Shenquan Huang ◽  
Yarong Chen ◽  
Fuh-Der Chou
Keyword(s):  
Single Machine ◽  
Preventive Maintenance ◽  
Completion Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Mixed Integer ◽  
Total Weighted Completion Time ◽  
Machine Failure ◽  
Periodic Preventive Maintenance ◽  
Weighted Completion Time

The single-machine scheduling problem with fixed periodic preventive maintenance, in which preventive maintenance is implemented periodically to maintain good machine operational status and decrease the cost caused by sudden machine failure, is studied in this paper. The adopted objective function is to minimise the total weighted completion time, which is representative of the minimisation of the global holding/inventory cost in the system. This problem is proven to be NP-hard; a position-based mixed integer programming model and an efficient heuristic algorithm with local improvement strategy are developed for the total weighted completion time problem. To evaluate the performances of the proposed heuristic algorithms, two new lower bounds are further developed. Computational experiments show that the proposed heuristic can rapidly achieve optimal results for small-sized problems and obtain near-optimal solutions with tight average relative percentage deviation for large-sized problems.

scholarly journals JIT single machine scheduling problem with periodic preventive maintenance

2016 ◽  
Vol 12 (3) ◽  
pp. 299-310 ◽  
Author(s):  
Mohammadreza Shahriari ◽  
Naghi Shoja ◽  
Amir Ebrahimi Zade ◽  
Sasan Barak ◽  
Mani Sharifi
Keyword(s):  
Single Machine ◽  
Preventive Maintenance ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Periodic Preventive Maintenance

Comparing Mathematical and Heuristic Rules for Solving Single Machine Scheduling Problem with Release and due Date Constraints

2014 ◽  
Vol 635-637 ◽  
pp. 1707-1710
Author(s):  
Yong Zhan ◽  
Hai Tao Zhu ◽  
Yu Guang Zhong
Keyword(s):  
Single Machine ◽  
Numerical Experiments ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Heuristic Rules ◽  
Due Date ◽  
Mip Model ◽  
Accuracy Of Results

The purpose of this paper is to compare a mixed integer programming (MIP) model, and heuristic rules based on their practical efficiency and the accuracy of results to tackle the minimum lateness single machine scheduling problem with release and due date constraints. Extensive numerical experiments are carried out on randomly generated testing instances in order to evaluate the performance of the MIP model and heuristic rules.

scholarly journals An accelerated MIP model for the single machine scheduling with preventive maintenance

2016 ◽  
Vol 49 (12) ◽  
pp. 1945-1949 ◽  
Author(s):  
Omar Souissi ◽  
Rachid Benmansour ◽  
Abdelhakim Artiba
Keyword(s):  
Single Machine ◽  
Preventive Maintenance ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Mip Model

Single-Machine Scheduling to Minimize Makespan with Deterioration Jobs and Multi-Maintenance Activities

2013 ◽  
Vol 690-693 ◽  
pp. 3007-3013
Author(s):  
Chou Jung Hsu ◽  
Hung Chi Chen
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Initial Condition ◽  
Computational Results ◽  
Maintenance Activity ◽  
Deterioration Jobs ◽  
Deterioration Effect ◽  
Maintenance Activities

This paper explored a single-machine scheduling deterioration jobs with multi-maintenance activities. The non-resumable case and simple linear deterioration effect were taken into account as well. We assumed that after a maintenance activity, the machine will revert to its initial condition and the deterioration effect will start anew. The objective was to minimize the makespan in the system. The problem was proven to be NP-hard in the strong sense. Therefore, a heuristic and a lower bound were introduced and tested numerically. Computational results showed that the proposed algorithm performed well.

Sign in / Sign up

Export Citation Format

Share Document