Online, non-preemptive scheduling of equal-length jobs on two identical machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4059 LNCS, Issue , 2006, Pages 113-123

  Goldwasser, Michael H ^a   Pedigo, Mark ^a  

^a SAINT LOUIS UNIVERSITY   (United States)

Author keywords

Algorithms; Online; Scheduling

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

DEADLINES; DETERMINISTIC ALGORITHM; NON-PREEMPTIVE SCHEDULING; OFFLINE SETTING;

RESOURCE ALLOCATION;

EID: 33746463118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_13     Document Type: Conference Paper

References (11)

1. P. Baptiste, P. Brucker, S. Knust, and V. G. Timkovsky. Ten notes on equalprocessing-time scheduling. 4OR: Quarterly J. Belgian, French and Italian Operations Research Societies, 2(2):111-127, July 2004.
2. S. K. Baruah, J. R. Haritsa, and N. Sharma. On-line scheduling to maximize task completions. J. Combin. Math, and Combin. Computing, 39:65-78, 2001.
3. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, New York, 1998.
4. M. Chrobak, W. Jawor, J. Sgall, and T. Tichý. Online scheduling of equal-length jobs: Randomization and restarts help. In J. Díaz, J. Karhumäki, A. Lepistö, and D. Sannella, editors, Proc. 31st Int. Colloquium on Automata, Languages and Programming (ICALP), volume 3142 of Lecture Notes in Computer Science, pages 358-370, Turku, Finland, July 2004. Springer-Verlag.
5. J. Ding and G. Zhang. Online scheduling with hard deadlines on parallel machines. In Proc. Second Int. Conference on Algorithmic. Aspects in Information and Management, Lecture Notes in Computer Science, Hong Kong, China, June 2006, Springer-Verlag, To appear.
6. S. Goldman, J. Parwatikar, and S. Suri, On-line scheduling with hard deadlines, J. Algorithms, 34(2):370-389, Feb. 2000.
7. M. H. Goldwasser. Patience is a virtue: The effect of slack on competitiveness for admission control, J. Scheduling, 6(2):183-211, Mar./Apr. 2003.
8. M. H. Goldwasser and B. Kerbikov, Admission control with immediate notification, J. Scheduling, 6(3):269-285, May/June 2003.
9. J. R. Jackson. Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles, Jan, 1955.
10. B. B. Simons. Multiprocessor scheduling of unit length jobs with arbitrary release times and deadlines, SIAM J. Comput., 12:294-299, 1983.
11. B. B. Simons and M. K. Warrnuth, A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM J. Comput., 18(4):690-710, 1989.