New upper and lower bounds for online scheduling with machine cost
暂无分享,去创建一个
[1] Rudolf Fleischer,et al. On‐line scheduling revisited , 2000 .
[2] Yong He,et al. Better Online Algorithms for Scheduling with Machine Cost , 2004, SIAM J. Comput..
[3] Ramaswamy Chandrasekaran,et al. Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..
[4] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[5] Yong He,et al. Scheduling with machine cost and rejection , 2006, J. Comb. Optim..
[6] Susanne Albers,et al. On randomized online scheduling , 2002, STOC '02.
[7] John Noga,et al. Scheduling with Machine Cost , 1999, RANDOM-APPROX.
[8] Csanád Imreh,et al. Online scheduling with machine cost and rejection , 2007, Discret. Appl. Math..
[9] Yong He,et al. Preemptive online algorithms for scheduling with machine cost , 2005, Acta Informatica.
[10] Csanád Imreh,et al. Online scheduling with general machine cost functions , 2009, Discret. Appl. Math..