Mathematical Programming Models for Competitive Two-Agent Single-Machine Scheduling with Flexible Periodic Maintenance Activities

2014 ◽  
Vol 39 (5) ◽  
pp. 3715-3722 ◽  
Author(s):  
Dehua Xu ◽  
Aihua Liu ◽  
Dar-Li Yang
Keyword(s):  
Mathematical Programming ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Programming Models ◽  
Periodic Maintenance ◽  
Mathematical Programming Models ◽  
Maintenance Activities

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.

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.

Sign in / Sign up

Export Citation Format

Share Document