A modified harmony search for the T-single machine scheduling problem with variable and flexible maintenance

作者：

Highlights：

• We address a complex single machine scheduling problem.

• We consider flexible and variable maintenance activity to be scheduled.

• We develop a novel self-adaptive harmony search algorithm.

• We compare different heuristic and meta-heuristic algorithms.

• We perform a sensitivity analysis involving several influencing factors.

摘要

•We address a complex single machine scheduling problem.•We consider flexible and variable maintenance activity to be scheduled.•We develop a novel self-adaptive harmony search algorithm.•We compare different heuristic and meta-heuristic algorithms.•We perform a sensitivity analysis involving several influencing factors.

论文关键词：Release date,Setup time,Metaheuristic algorithm,Linear programming,Harmony search,ANOVA

论文评审过程：Received 16 June 2021, Revised 4 December 2021, Accepted 12 March 2022, Available online 18 March 2022, Version of Record 23 March 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.116897