Experimental analysis of tardiness in preemptive single machine scheduling
Expert Systems with Applications(2021)
摘要
•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
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要