On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

Operations Research Letters

Volumn 30, Issue 6, 2002, Pages 415-420

  Epstein, Leah ^a   Noga, John ^b   Woeginger, Gerhard J ^c,d  

^a INTERDISCIPLINARY CENTER   (Israel)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF TWENTE   (Netherlands)

^d GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Competitive analysis; On line algorithm; Scheduling; Worst case bounds

Indexed keywords

ALGORITHMS; JOB ANALYSIS; POLYNOMIALS;

COMPETITIVE ANALYSIS;

SCHEDULING;

EID: 0036887947     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00160-8     Document Type: Article

References (6)

1. Bartal Y., Leonardi S., Marchetti-Spaccamela A., Sgall J., Stougie L. Multiprocessor scheduling with rejection. SIAM J. Discrete Math. 13:2000;64-78.
2. D.W. Engels, D.R. Karger, S.G. Kolliopoulos, S. Sengupta, R.N. Uma, J. Wein, Techniques for scheduling with rejection, Proceedings of the Sixth European Symposium on Algorithms (ESA'1998), Lecture Notes in Computer Science, Vol. 1461, Springer, Berlin, 1998, pp. 490-501.
3. H. Hoogeveen, M. Skutella, G.J. Woeginger, Preemptive scheduling with rejection, Proceedings of the Eighth European Symposium on Algorithms (ESA'2000), Lecture Notes in Computer Science, Vol. 1879, Springer, Berlin, 2000, pp. 268-277.
4. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Logistics of Production and Inventory. Handbooks in Operations Research and Management Science. Vol. 4:1993;445-522 North-Holland, Amsterdam.
5. Seiden S.S. Preemptive multiprocessor scheduling with rejection. Theoret. Comput. Sci. 262:2001;437-458.
6. Sgall J. On-line scheduling. Fiat A., Woeginger G.J. On-line Algorithms: The State of the Art. Lecture Notes in Computer Science. Vol. 1442:1998;196-231 Springer, Berlin.