[1] |
Hwang H C,Chang S Y,Lee K.Parallel machine scheduling under a grade of service provision[J].Computers and Operations Research,2004,31 (12):2055-2061.
|
[2] |
Wu Y,Ji M,Yang Q F.Optimal semi-online scheduling algorithm on two parallel identical machines under a grade of service provision[J].International Journal of Production Economics,2011,135(1):367-371.
|
[3] |
Zhang A, Jiang Y W,Tan Z Y.Online parallel machines scheduling with two hierarchies[J].Theoretical Computer Science,2009,410(38):3597-3605.
|
[4] |
Zhang A,Jiang Y W,Fan L D,et al.Optimal online algorithms on two hierarchical machines with tightly-grouped processing times[J].Journal of Combinatorial Optimization,2015,29(4):781-795.
|
[5] |
Cai S, Liu K.Heuristics for online scheduling on identical parallel machines with two GoS levels[J].Journal of Systems Science & Complexity,2019,32(4):1180-1193.
|
[6] |
Albers S.On randomized online scheduling[C]∥Proc of the 34th ACM Symposium on Theory of Computing,2002:134-143.
|
[7] |
Rudin J F, John F,Chandrasekaran R.Improved bounds for the online scheduling problem[J].SIAM Journal on Computing,2003,32(3):717-735.
|
[8] |
Azar Y, Regev O.On-line bin-stretching[J].Theoretical Computer Science,2001,268(1):17-41.
|
[9] |
Cao Q,Liu Z H.Semi-online scheduling with known maximum job size on two uniform machines[J].Journal of Combinatorial Optimization,2010,20(4):369-384.
|
[10] |
Kellerer H,Kovov V,Speranza M R,et al.Semi on-line algorithms for the partition problem[J].Operations Research Letters,1997,21(5):235-242.
|
[11] |
Xiao M, Ding L, Zhao S, et al. Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1[C]∥Proc of 38th National Conference of Theoretical Computer Science,2020:47-56.
|
[12] |
Park J,Chang S Y,Lee K.Online and semi-online sched- uling of two machines under a grade of service provision[J].Operations Research Letters,2006,34(6):692-696.
|
[13] |
Chen X,Ding N,Dósa G,et al.Online hierarchical sched- uling on two machines with known total size of low- hierarchy jobs[J].International Journal of Computer Mathematics,2015,92(5):873-881.
|
[14] |
Cao Q,Liu Z H,Cheng T C E.Semi-online scheduling with known partial information about job sizes on two identical machines[J].Theoretical Computer Science,2011,412(29):3731-3737.
|
[15] |
Xiao Man,Ding Lu,Zhang Yi.Semi-online algorithms for hierarchical scheduling on three parallel machines[J].Computer Engineering & Science,2020,42 (12):2252-2258.(in Chinese)
|
[16] |
Wu Y, Cheng T C E, Ji M.Optimal algorithms for semi- online machine covering on two hierarchical machines[J].Theoretical Computer Science,2014,531(6):37-46.
|
[17] |
Dósa G,Wang Y X,Han X,et al.Online scheduling with rearrangement on two related machines[J].Theoretical Computer Science,2011,412 (8-10):642-653.
|
[18] |
Sanders P,Sivadasan N,Skutella M.Online scheduling with bounded migration[J].Mathematics of Operations Research,2009,34(2):481-498.
|
[19] |
Tan Z Y,Yu S H.Online scheduling with reassignment[J].Operations Research Letters,2007,36(2):250-254.
|
[20] |
Min X,Liu J,Wang Y Q.Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines[J].Information Processing Letters,2011,111(9):423-428.
|
[21] |
Wang Y X,Benko A,Chen X,et al.Online scheduling with one rearrangement at the end:Revisited[J].Information Processing Letters,2012,112(16):641-645.
|
[22] |
Chen X, Xu Z Z,Dósa G,et al.Semi-online hierarchical scheduling problems with buffer or rearrangements [J].Information Processing Letters,2013,113(4):127-131.
|
[23] |
Qi X L, Yuan J J. Semi-online hierarchical scheduling for lp-norm load balancing with buffer or rearrangements[J].A Quarterly Journal of Operations Research,2017,15(3):265-276.
|
[24] |
Min Xiao. Optimal semi-online algorithm for covering pro- blem with reassignment on two identical machines[J].Journal of Jiaxing University,2012,24 (3):35-37.(in Chinese)
|
|
附中文参考文献:
|
[15] |
肖满, 丁璐,张怡.带两个服务等级的3台机半在线算法[J].计算机工程与科学,2020,42(12):2252-2258.
|
[24] |
闵啸.两台可重排平行机覆盖问题的最优在线算法[J].嘉兴学院学报,2012,24(3):35-37.
|