Preemptive stochastic online scheduling on two uniform machines

Information Processing Letters

Volumn 109, Issue 7, 2009, Pages 369-375

  Gu, Manzhan ^a   Lu, Xiwen ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Analysis of algorithms; Online policy; Preemptive; Stochastic scheduling; Uniform machine

Indexed keywords

MACHINERY; RANDOM PROCESSES; RANDOM VARIABLES; STOCHASTIC CONTROL SYSTEMS;

ANALYSIS OF ALGORITHMS; ONLINE POLICY; PREEMPTIVE; STOCHASTIC SCHEDULING; UNIFORM MACHINE;

SCHEDULING;

EID: 59349107938     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.12.008     Document Type: Article

References (13)

1. Rothkopf M.H. Scheduling with random service times. Management Science 12 (1966) 703-713
2. Bruno J.L., Downey P.J., and Frederickson G.N. Sequencing tasks with exponential service times to minimize the expected flowtime or makespan. Journal of the ACM 28 (1981) 100-113
3. Kämpke T. Optimal scheduling of jobs with exponential service times on identical parallel processors. Operations Research 37 1 (1989) 126-133
4. Mabel Chou C.-F., Liu H., Queyranne M., and Simchi-Levi D. On the asymptotic optimality of a simple on-line algorithm for the stochastic single machine weighted completion time problem and its extensions. Operations Research 54 3 (2006) 464-474
5. Möhring R.H., Schulz A.S., and Uetz M. Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the ACM 46 (1999) 924-942
6. Megow N., Uetz M., and Vredeveld T. Models and algorithms for stochastic online scheduling. Mathematics of Operations Research 31 3 (2006) 513-525
7. A.S. Schulz, New old algorithms for stochastic scheduling, in: Algorithms for Optimization with Incomplete Information, Dagstuhl Seminar Proceedings, no. 05031, 2005
8. Chazan D., Konheim A.G., and Weiss B. A note on time sharing. Journal of Combinatorial Theory 5 (1968) 344-369
9. Konheim A.G. A note on time sharing with preferred customers. Probability Theory and Related Fields 9 (1968) 112-130
10. Sevcik K.C. Scheduling for minimum total loss using service time distributions. Journal of the ACM 21 (1974) 65-75
11. N. Megow, T. Vredeveld, Approximation results for preemptive stochastic online scheduling, Technical Report 8/2006, Technische Universität Berlin, April 2006
12. Weiss G. On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines. Advances in Applied Probability 27 (1995) 827-845
13. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing an scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-544