Scheduling with machine cost

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

Volumn 1671, Issue , 1999, Pages 168-176

  Imreh, Csanád ^a,b   Noga, John ^c  

^a UNIVERSITY OF SZEGED   (Hungary)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

COMPETITIVE RATIO; MACHINE COSTS; ONLINE SCHEDULING; SCHEDULING PROBLEM; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 84958759169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_18     Document Type: Conference Paper

References (8)

1. Susanne Albers. Better bounds for online scheduling. In Proc. 29th Symp. Theory of Computing, pages 130-139, 1997.
2. Chandra Chekuri, Rajeev Motwani, Balas Natarajan, and Cliff Stein. Approxi- mation techniques for average completion time scheduling. In Proc. 8th Symp. on Discrete Algorithms, pages 609-618, 1997.
3. Bo Chen, Andre van Vliet, and Gerhard J. Woeginger. New lower and upper bounds for on-line scheduling. Operations Research Letters, 16:221-230, 1994.
4. Bo Chen and Arjen P. A. Vestjens. Scheduling on identical machines: How good is LPT in an on-line setting? Operations Research Letters, 21:165-169, 1998.
5. Gábor Galambos and Gerhard J. Woeginger. An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling. SIAM Journal on Computing, 22:349-355, 1993.
6. Ronald L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
7. John Noga and Steven Seiden. Scheduling two machines with release times. To appear at Integer Programming and Combinatorial Optimization, 1999.
8. David B. Shmoys, Joel Wein, and David P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313-1331, 1995.