arrow
返回

A simple linear time algorithm for scheduling with step-improving processing times

delete2007-08-01
delete4
PRE
AI
M
Min Ji
何
何勇 (Yong He)
T
T.C.E. Cheng *
DOI:10.1016/j.cor.2005.09.011delete
delete原文链接
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
2.3W

机构

暂无机构信息
引用论文

引用论文

Autonomous mobile robots with lights
err2016-01-01
err0
errOAAI
errShantanu Das; Paola Flocchini; Giuseppe Prencipe; Nicola Santoro; Masafumi Yamashita
err分享
err收藏
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
err2004-01-01
err0
PREAI
errMarek Chrobak; Wojciech Jawor; Jiří Sgall; Tomáš Tichý
err分享
err收藏