List scheduling for jobs with arbitrary release times and similar lengths

Journal of Scheduling

Volumn 10, Issue 6, 2007, Pages 365-373

  Li, Rongheng ^a   Huang, Huei Chuen ^b  

^a HUNAN NORMAL UNIVERSITY   (China)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Competitive ratio; List scheduling; Makespan; On line scheduling

Indexed keywords

ARBITRARY RELEASE TIMES; LIST SCHEDULING ALGORITHM; MAKESPAN; PARALLEL IDENTICAL MACHINES;

ALGORITHMS; COMPETITION; JOB ANALYSIS; ONLINE SYSTEMS;

SCHEDULING;

EID: 35548954205     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-007-0042-8     Document Type: Article

References (10)

1. Azar, Y., & Regev, O. (2001). On-line bin stretching. Theoretical Computer Science, 268, 17-41.
2. Dósa, G., & He, Y. (2004). Semi-online algorithms for parallel machine scheduling problems. Computing, 72, 355-363.
3. Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416-429.
4. He, Y., & Zhang, G. (1999). Semi on-line scheduling on two identical machines. Computing, 62, 179-187.
5. Kellerer, H. (1991). Bounds for non-preemptive scheduling jobs with similar processing times on multiprocessor systems using LPT-algorithm. Computing, 46, 183-191.
6. Kellerer, H., Kotov, V., Speranza, M. G., & Tuza, Z. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21, 235-242.
7. Li, R., & Huang, H. C. (2004). On-line scheduling for jobs with arbitrary release times. Computing, 73, 79-97.
8. Liu, W. P., Sidney, J. B., & Vliet, A. (1996). Ordinal algorithm for parallel machine scheduling. Operations Research Letters, 18, 223-232.
9. Seiden, S., Sgall, J., & Woeginger, G. J. (2000). Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27, 215-227.
10. Tan, Z. Y., & He, Y. (2002). Semi-online problem on two identical machines with combined partial information. Operations Research Letters, 30, 408-414.