An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead
2015 ◽
Vol 32
(06)
◽
pp. 1550047
Keyword(s):
This paper studies the online preemptive scheduling of equal-length intervals on a single machine with lookahead. Let [Formula: see text] be the length (processing time) of all intervals. In the problem, at every time point [Formula: see text], online algorithms can foresee all the intervals that will arrive in the time segment [Formula: see text] for a certain [Formula: see text]. When [Formula: see text], Zheng et al. [Comput- ers & Operations Research, 2013] established a lower bound of [Formula: see text] and provided an online algorithm with a competitive ratio of 3. In this paper, we provide for this problem an improved online algorithm with a competitive ratio of 2.
2016 ◽
Vol 33
(04)
◽
pp. 1650027
Keyword(s):
Keyword(s):
2013 ◽
Vol 2013
◽
pp. 1-7
◽
2015 ◽
Vol 32
(04)
◽
pp. 1550030
◽
2015 ◽
Vol 32
(04)
◽
pp. 1550028
Keyword(s):
2012 ◽
Vol 04
(02)
◽
pp. 1250015
◽
Keyword(s):
2018 ◽
Vol 35
(06)
◽
pp. 1850048
Keyword(s):
2010 ◽
Vol 110
(8-9)
◽
pp. 325-330
◽
Keyword(s):
2007 ◽
Vol 24
(02)
◽
pp. 263-277
◽