An uncertain single machine scheduling problem with periodic maintenance

作者：

Highlights：

• A technical means is used to obtain the bound of uncertain scheduling problem.

• Three uncertain programming model under different criteria are proposed.

• Some properties under uncertain environment and a hybrid algorithm are proposed.

摘要

•A technical means is used to obtain the bound of uncertain scheduling problem.•Three uncertain programming model under different criteria are proposed.•Some properties under uncertain environment and a hybrid algorithm are proposed.

论文关键词：Single machine,Periodic maintenance,Longest processing time algorithm,Worst-case ratio,Hybrid intelligent algorithm

论文评审过程：Received 4 August 2017, Revised 18 October 2017, Accepted 20 December 2017, Available online 28 December 2017, Version of Record 14 February 2018.

论文官网地址：https://doi.org/10.1016/j.knosys.2017.12.021