A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES
2014 ◽
Vol 31
(04)
◽
pp. 1450030
◽
Keyword(s):
We consider online scheduling of unit length jobs on m identical parallel-batch machines. Jobs arrive over time. The objective is to minimize maximum flow-time, with the flow-time of a job being the difference of its completion time and its release time. A parallel-batch machine can handle up to b jobs simultaneously as a batch. Here, the batch capacity is bounded, that is b < ∞. In this paper, we provide a best possible online algorithm for the problem with a competitive ratio of [Formula: see text].
2018 ◽
Vol 35
(04)
◽
pp. 1850026
Keyword(s):
Keyword(s):
Keyword(s):
2015 ◽
Vol 32
(04)
◽
pp. 1550030
◽
2007 ◽
Vol 24
(03)
◽
pp. 373-382
◽
2015 ◽
Vol 32
(04)
◽
pp. 1550028
Keyword(s):
2018 ◽
Vol 14
(4)
◽
pp. 1479-1500
2018 ◽
Vol 35
(06)
◽
pp. 1850048
2014 ◽
Vol 25
(06)
◽
pp. 745-761
◽