Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines

Computing (Vienna/New York)

Volumn 76, Issue 1-2, 2006, Pages 149-164

  Dosa G ^a,b   He, Y ^a,c  

^a University of Veszprém ^*

^b UNIVERSITY OF PANNONIA   (Hungary)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

Competitive analysis; On line algorithms; Preemption; Rejection; Scheduling

Indexed keywords

COMPETITIVE ANALYSIS; ON-LINE ALGORITHMS; PREEMPTION; REJECTION;

ALGORITHMS; JOB ANALYSIS; OPTIMAL CONTROL SYSTEMS; SCHEDULING;

ONLINE SYSTEMS;

EID: 27644440807     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-005-0130-6     Document Type: Article

References (8)

1. Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discrete Math. 13, 64-78 (2001).
2. Epstein, L., Noga, J., Seiden, S. S., Sgall, J., Woeginger, G. J.: Randomized on-line scheduling for two related machines. J. Scheduling 4, 71-92 (2001).
3. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39, 43-57 (2004).
4. He, Y., Min, X.: On-line machine scheduling with rejection. Computing 65, 1-12 (2000).
5. Hoogeveen, H., Skutella, M., Woeginger, G. J.: Preemptive scheduling with rejection. Math. Progr. Ser. B 94, 361-374 (2003).
6. Seiden, S. S.: Preemptive multiprocessor scheduling with rejection. Theor. Comput. Sc. 262, 437-458 (2001).
7. Seiden, S. S.: On-line randomized multiprocessor scheduling. Algorithmica 28, 173-216 (2000).
8. Wen, J. J., Du, D. L.: Preemptive on-line scheduling for two uniform processors. Operat. Res. Lett. 23, 113-116 (1998).