Scheduling with rejection and non-identical job arrivals

Journal of Systems Science and Complexity

Volumn 20, Issue 4, 2007, Pages 529-535

  Cao, Zhigang ^a   Zhang, Yuzhong ^b  

^a INSTITUTE OF SYSTEMS SCIENCE   (China)

^b QUFU NORMAL UNIVERSITY   (China)

Author keywords

Non identical job arrival; On line; Rejection; Scheduling

Indexed keywords

COMPETITIVE RATIO; NON-IDENTICAL JOB ARRIVALS; ON-LINE SPECIAL CASE; REJECTION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; JOB ANALYSIS; PROBLEM SOLVING;

SCHEDULING;

EID: 35948943154     PISSN: 10096124     EISSN: 15597067     Source Type: Journal    
DOI: 10.1007/s11424-007-9050-1     Document Type: Article

References (9)

1. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie, Multiprocessor scheduling with rejection, SIAM Journal of Discrete Maths, 2000, 13(1): 64-78.
2. Y. He and X. Min, On-line uniform machine scheduling with rejection, Computing, 2000, 65(1): 1-12.
3. H. Hoogeveen, M. Skutella, and G. J. Woeginger, Preemptive scheduling with rejection, Lecture Notes in Computer Science, 2000, 1879: 268-277.
4. S. S. Seiden, Preemptive multiprocessor scheduling with rejection, Theoretical Computer Science, 2001, 262(1): 437-458.
5. D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma, and J. Wein, Techniques for scheduling with rejection. Lecture Notes in Computer Science, 1998, 1461: 490-501.
6. L. Epstein, J. Noga, and G. J. Woeginger, On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters, 2002, 30(6): 415-420.
7. S. Sengupta, Algorithms and approximation schemes for mimimum lateness/tardiness scheduling with rejection, Lecture Notes in Computer Science, 2003, 2748: 79-90.
8. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling, Annals of Discrete Mathematics, 1979, 5: 287-326.
9. G.J. Woeginger, When does a dynamic programming formulation guarantee the exitence of an FPTAS? INFORMS Journal on Computing, 2000, 12(1): 57-74.