Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

Acta Informatica

Volumn 40, Issue 5, 2004, Pages 367-383

  He, Yong ^a,b   Jiang, Yiwei ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE SPEED; ONLINE-SCHEDULING; OPTIMAL ALGORITHMS; SPEED RATIO;

ALGORITHMS; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; JOB ANALYSIS; MACHINE DESIGN; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

ONLINE SYSTEMS;

EID: 17644416530     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-003-0134-7     Document Type: Article

References (15)

1. Chen B, van Vliet A, Woeginger G (1995) An optimal algorithm for preemptive on-line scheduling.Operations Research Letters 18: 127-131
2. Epstein L (2001) Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. Operations Research Letters 29: 93-98
3. Epstein L (2003) Bin stretching revisited. Acta Informatica 39: 97-117
4. Epstein L, Favrholdt L (2002) Optimal preemptive semi-online scheduling to minimize makespan on two related machines. Operations Research Letters 30: 269-275
5. Epstein L, Noga J, Seiden S, Sgall J, Woeginger G (2001) Randomized on-line scheduling on two uniform machines. Journal of Scheduling 4: 71-92
6. Epstein L, Sgall J (2000) A lower bound for on-line scheduling on uniformly related machines. Operations Research Letters 26: 17-22
7. Graham RL (1969) Bounds on multiprocessing finishing anomalies. SIAM Journal on Applied Mathematics 17: 416-429
8. Gonzalez T, Sahni S (1978) Preemptive scheduling of uniform processor systems. J. Assoc. Comput. Mach. 25: 92-101
9. He Y, Jiang YW (to appear) Optimal preemptive algorithm for semi-online scheduling with tightly-grouped processing times. Journal of Computer Science and Technology
10. He Y, Zhang GC (1999) Semi on -line scheduling on two identical machines. Computing 62, 179-187
11. Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Operations Research Letters 21: 235-242
12. Sgall J (1997) A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters 63: 51-55
13. Seiden S, Sgall J, Woeginger G (2000) Semi-online scheduling with decreasing job sizes. Operations Research Letters 27: 215-221
14. Vestjens APA (1998) Scheduling uniform machines on-line requires nondecreasing speed ratios. Mathematical Programming 82: 225-234
15. Wen J, Du D (1998) Preemptive on-line scheduling for two uniform processors. Operations Research Letters 23: 113-116