Online single-machine scheduling to minimize the linear combination of makespans of two agents

Information Processing Letters（2022）

引用 2|浏览3

暂无评分

摘要

•An online two-agent single-machine scheduling problem is considered.•An approximation algorithm is developed.•The competitive ratio of the approximation algorithm is analyzed.•The competitive ratio is better than that obtained by Ding and Sun (2010).•The analysis of the competitive ratio is tight.

查看译文

关键词

Scheduling,Two-agent,Release dates,Online algorithm,Competitive ratio

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要