A PTAS for parallel batch scheduling with rejection and dynamic job arrivals-Reference-Cited by-同舟云学术

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

Published:2009-06 Issue:27-29 Volume:410 Page:2732-2745
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cao Zhigang,Yang Xiaoguang

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

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. Scheduling a batching machine;Brucker;Journal of Scheduling,1998

4. Multiprocessor scheduling with rejection;Bartal;SIAM Journal of Discrete Maths,2000

5. On several scheduling problems with rejection or discretely compressible processing times;Cao;Lecture Notes in Computer Science,2006

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel-batch scheduling with rejection: Structural properties and approximation algorithms;European Journal of Operational Research;2023-11

2. Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection;RAIRO - Operations Research;2023-05

4. Modeling and solution methods for hybrid flow shop scheduling problem with job rejection;Operational Research;2021-03-17

5. Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection;Journal of Scheduling;2020-06-11