Preemptive on-line scheduling for two uniform processors

Operations Research Letters

Volumn 23, Issue 3-5, 1998, Pages 113-116

  Wen, Jianjun ^a   Du, Donglei ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Competitive ratio; On line scheduling; Preemption; Uniform processors

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; OPTIMIZATION; PROCESS CONTROL; SCHEDULING;

PREEMPTIVE ONLINE SCHEDULING; UNIFORM PROCESSORS;

PRODUCTION CONTROL;

EID: 0032178181     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6377(98)00032-7     Document Type: Article

References (5)

1. B. Chen, A. Van Vliet, G. Woeginger, An optimal algorithm for preemptive on-line scheduling, Oper. Res. Lett. 18 (1995) 127-131.
2. T. Gonzalez, S. Sahni, Preemptive scheduling of uniform processor systems, J. Assoc. Comput. Mach. 25 (1978) 92-101.
3. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
4. A. Karlin, M. Manasse, L. Rudolph, D.D. Sleator, Competitive snoopy efficiency, Algorithmica 3 (1988) 79-119.
5. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28 (1985) 202-208.