Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness

标题
Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness
作者
关键词
Single machine scheduling, Due dates, Total weighted tardiness, Online heuristic, Arbitrary processing times
出版物
COMPUTERS & INDUSTRIAL ENGINEERING
Volume -, Issue -, Pages 107090
出版商
Elsevier BV
发表日期
2021-01-01
DOI
10.1016/j.cie.2020.107090

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started