Online scheduling of equal-processing-time task systems

Theoretical Computer Science

Volumn 401, Issue 1-3, 2008, Pages 85-95

  Huo, Yumei ^a   Leung, Joseph Y T ^b   Wang, Xin ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b University Heights   (United States)

Author keywords

Competitive ratio; Equal processing time tasks; Intree precedence constraints; Makespan; Online scheduling; Parallel and identical machines

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CHEMICAL MODIFICATION; EVOLUTIONARY ALGORITHMS; MICROFLUIDICS; ONLINE SYSTEMS; SCHEDULING; SET THEORY;

ASYMPTOTIC COMPETITIVE RATIO; COMPETITIVE RATIOS; ELSEVIER (CO); LIST-SCHEDULING; MAKESPAN; ONLINE SCHEDULING; PRECEDENCE CONSTRAINTS;

SCHEDULING ALGORITHMS;

EID: 45049087046     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.03.026     Document Type: Article

References (9)

1. Coffman Jr. E.G., and Graham R.L. Optimal scheduling for two-processor systems. Acta Informatica 1 (1972) 200-213
2. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, San Francisco
3. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
4. Hu T.C. Parallel sequencing and assembly line problems. Operations Research 9 (1961) 841-848
5. Huo Y., and Leung J.Y.-T. Online scheduling of precedence constrained tasks. SIAM Journal on Computing 34 (2005) 743-762
6. Lam S., and Sethi R. Worst case analysis of two scheduling algorithms. SIAM Journal on Computing 6 (1977) 518-536
7. Muntz R.R., and Coffman Jr. E.G. Optimal preemptive scheduling on two-processor systems. IEEE Transactions on Computers 18 (1969) 1014-1020
8. Muntz R.R., and Coffman Jr. E.G. Preemptive scheduling of real-time tasks on multiprocessor systems. Journal of ACM 17 (1970) 324-338
9. Sgall J. Online Algorithms: The State of the Art. In: Fiat A., and Woeginger G.J. (Eds). Lecture Notes in Computer Science vol. 1442 (1998), Springer 196-231