A PTAS for parallel batch scheduling with rejection and dynamic job arrivals

Theoretical Computer Science

Volumn 410, Issue 27-29, 2009, Pages 2732-2745

  Cao, Zhigang ^a   Yang, Xiaoguang ^a  

^a CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

Dynamic job arrivals; Parallel batch; PTAS; Rejection; Scheduling

Indexed keywords

BATCH-SCHEDULING; COMBINED MODELS; DYNAMIC JOB ARRIVALS; MAKESPAN; PARALLEL BATCH; PENALTY COSTS; PROCESSING TIME; PTAS; REJECTION; SCHEDULING MODELS;

SYSTEMS ENGINEERING; WIRELESS TELECOMMUNICATION SYSTEMS;

SCHEDULING;

EID: 65549157614     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.04.006     Document Type: Article

References (23)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, 32-43
2. J.J. Bartholdi, unpublished manuscript, 1988
3. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C.N., Tautenhahn T., and van de Velde S.L. Scheduling a batching machine. Journal of Scheduling 1 1 (1998) 31-54
4. Bartal Y., Leonardi S., Marchetti-Spaccamela A., Sgall J., and Stougie L. Multiprocessor scheduling with rejection. SIAM Journal of Discrete Maths 13 1 (2000) 64-78
5. Cao Z., Wang Z., Zhang Y., and Liu S. On several scheduling problems with rejection or discretely compressible processing times. Lecture Notes in Computer Science 3959 (2006) 90-98
6. Cao Z., and Zhang Y. Scheduling with rejection and non-identical job arrivals. Journal of Systems Science and Complexity 20 4 (2007) 529-535
7. Deng X., Feng H., Li G., and Shi B. A PTAS for semiconductor burn-in scheduling. Journal of Combinatorial Optimization 9 (2005) 5-17
8. Deng X., Poon C.K., and Zhang Y. Approximation algorithms in batch processing. Journal of Combinational Optimization 7 3 (2003) 247-257
9. Engels D.W., Karger D.R., Kolliopoulos S.G., Sengupta S., Uma R.N., and Wein J. Techniques for scheduling with rejection. Lecture Notes in Computer Science vol. 1461 (1998) 490-501
10. Epstein L., Noga J., and Woeginger G.J. On-line scheduling of unit time jobs with rejection: Minimizing the total completion time. Operations Research Letters 30 6 (2002) 415-420
11. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics 5 (1979) 287-326
12. He Y., and Min X. On-line uniform machine scheduling with rejection. Computing 65 1 (2000) 1-12
13. Hoogeveen H., Skutella M., and Woeginger G.J. Preemptive scheduling with rejection. Mathematical Programming Serial B94 (2003) 361-374
14. Ikura Y., and Gimple M. Scheduling algorithms for a single batch processing machine. Operations Research Letters 5 (1986) 61-65
15. Li S., Li G., Wang X., and Liu Q. Minimizing makespan on a single machine with release times and non-identical job sizes. Operations Research Letter 33 2 (2005) 157-164
16. Li S., Li G., and Zhang S. Minimizing makespan with release times on identical parallel batching machines. Discrete Applied Mathematics 148 1 (2005) 127-134
17. Lee C.Y., and Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37 (1999) 219-236
18. Potts C.N., and Lovalyov M.Y. Scheduling with batching: A review. European Journal of Operational Research 120 (2000) 228-249
19. Poon C.K., and Zhang P. Minimizing makespan in batch machine scheduling. Algorithmica 39 2 (2004) 155-174
20. Seiden S.S. Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science 262 1 (2001) 437-458
21. Sengupta S. Algorithms and approximation schemes for minimum lateness/tardiness scheduling with rejection. Lecture Notes in Computer Science vol. 2748 (2003) 79-90
22. Wang Z., Cao Z., and Zhang Y. Single machine batch scheduling with rejection to minimize makespan. Journal of Qufu Normal University 33 2 (2007) 35-38 in Chinese
23. Zhang Y., Cao Z., and Bai Q. A PTAS for batch scheduling on agreeable unrelated parallel machines with dynamic job arrivals. Lecture Notes in Computer Science vol. 3521 (2005) 162-171