A parallel-machine scheduling problem with periodic maintenance under uncertainty

作者：Shen, Jiayu^*; Zhu, Yuanguo

来源：Journal of Ambient Intelligence and Humanized Computing, 2019, 10(8): 3171-3179.

DOI：10.1007/s12652-018-1032-8

• Parallel machine
• Maintenance
• Makespan
• Worst-case
• LPT

A parallel-machine scheduling problem with preventive maintenance is studied in the paper. Because of the existence of indeterminacy phenomenon, the processing and maintenance time are assume to be uncertain variables. To address these uncertain parameters, two pessimistic value mathematical programming models are developed and the equivalence is proved. The worst-case bound of longest processing time (LPT) rule for the problem under an uncertain environment is obtained. To solve this problem effectively, an improved LPT rule is proposed according to the result of the theoretical analysis. Finally, numerical experiments show that the improved LPT outperforms the LPT in improving the quality of the optimal value and has a less relative error than that of the LPT.

• 出版日期2019-8
• 单位南京工业职业技术学院; 南京理工大学