SEMI-ONLINE MACHINE COVERING
2007 ◽
Vol 24
(03)
◽
pp. 373-382
◽
Keyword(s):
This paper investigates two different semi-online versions of the machine covering, which is the problem of assigning a set of jobs to a system of m(m ≥ 3) identical parallel machines so as to maximize the earliest machine completion time. In the first case, we assume that the largest processing times is known in advance. In the second case, we assume that the total processing times of all jobs is known in advance. For each version we propose a semi-online algorithm and investigate its competitive ratio. The competitive ratio of each algorithm is [Formula: see text], which is shown to be the best possible competitive ratio for each semi-online problem.
2018 ◽
Vol 35
(04)
◽
pp. 1850024
2014 ◽
Vol 25
(06)
◽
pp. 745-761
◽
2016 ◽
Vol 33
(04)
◽
pp. 1650027
Keyword(s):
2014 ◽
Vol 31
(04)
◽
pp. 1450030
◽
Keyword(s):
2000 ◽
Vol 25
(1)
◽
pp. 63-75
◽
2008 ◽
Vol 40
(5-6)
◽
pp. 572-581
◽
2018 ◽
Vol 35
(06)
◽
pp. 1850048
2010 ◽
Vol 58
(4)
◽
pp. 729-738
◽