Experimental analysis of tardiness in preemptive single machine scheduling
作者：
Highlights：
• Total Weighted Tardiness heuristic is extended into a metaheuristic with 4 branches.
• The metaheuristic is rendered to a single branch based on the problem type.
• One of the 2 branches is executed depending on the job processing time.
• The branches tend to become equally accurate as the problem size is increased.
• Branches outperform exact solution approaches in scheduling more than 10 jobs.
摘要
•Total Weighted Tardiness heuristic is extended into a metaheuristic with 4 branches.•The metaheuristic is rendered to a single branch based on the problem type.•One of the 2 branches is executed depending on the job processing time.•The branches tend to become equally accurate as the problem size is increased.•Branches outperform exact solution approaches in scheduling more than 10 jobs.
论文关键词：Single machine scheduling,Due dates,Total weighted tardiness,Online metaheuristic,Computational tractability
论文评审过程：Received 9 June 2020, Revised 17 February 2021, Accepted 24 March 2021, Available online 8 April 2021, Version of Record 2 September 2021.
论文官网地址：https://doi.org/10.1016/j.eswa.2021.114947
