1 |
Graham, R. L. (1966), Bounds for certain multiprocessor anomalies, Bell System Technical Journal, 45, 1563-1581
DOI
|
2 |
He, Y. and Zhang, G. C. (1999), Semi online scheduling on two identical machines, Computing, 62, 179-187
DOI
ScienceOn
|
3 |
Kellerer, H. Kotov, V. Speranza, M. G., and Tuza, Z. (1997), Semi-online algorithms for the partitioning problem, Operations Research Letters, 21, 235-242
DOI
ScienceOn
|
4 |
Sleator, D. and Tarjan, R. E. (1985), Amorized efficiency of list update and paging rules, Communications of the ACM, 28, 202-208
DOI
ScienceOn
|
5 |
Tan, Z. and He, Y. (2002), Semi-online problems on two identical machines with combined partial information, Operations Research Letters, 30, 408-414
DOI
ScienceOn
|
6 |
Angelelli, E., Speranza, M. G., and Tuza, Zs. (2007), Semi on-line scheduling on three processors with known sum of the tasks, Journal of Scheduling, 10, 263-269
DOI
ScienceOn
|
7 |
Azar, Y. Naor, J. and Rom, R. (1995), The competitiveness of online assignments, Journal of Algorithms, 18, 221-237
DOI
ScienceOn
|
8 |
Hwang, H. C. Chang, S. Y., and Hong, Y. (2004), A Posterior Competitiveness for List Scheduling Algorithm on Machines with Eligibility Constraints, Asia-Pacific Journal of Operational Research, 21, 117-125
DOI
ScienceOn
|
9 |
Park, J. Chang, S. and Lee K. (2006), Online and semi-online scheduling of two machines under a grade of service provision, Operations Research Letters, 34, 692-696
DOI
ScienceOn
|