返回
A simple linear time algorithm for scheduling with step-improving processing times
DOI:10.1016/j.cor.2005.09.011.png)
摘要
En 中文
We consider the problem of scheduling jobs with step-improving processing times around a common critical date on a single machine to minimize the makespan. For this problem, we present a simple linear time off-line approximation algorithm and prove its worst-case performance guarantee. (c) 2005 Elsevier Ltd. All rights reserved.
Keyword:
scheduling
approximation algorithm
worst-case ratio
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
2.3W
机构
暂无机构信息

