A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling-Reference-Cited by-同舟云学术

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling

Published:2002 Issue: Volume: Page:304-314
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Cai Mao-Cheng,Deng Xiaotie,Feng Haodi,Li Guojun,Liu Guizhen

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47867-1_22

Reference6 articles.

1. Foto Afrati, Evripidis Bampis, Chandra Chekuri, David Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Cliff Stein, Maxim Sviridenko: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. the proceeding of the 40th Annual Symposium on Foundations of Computer Science, New York (Oct. 1999) 32–43.

2. P. Brucker, A. Gladky, H. Hoogeveen, M. Kovalyov, C. Potts, T. Tautenhahn, S. van de Velde: Scheduling a batching machine. Journal of Scheduling 1 (1998) 31–54.

3. Chandru V., C. Y. Lee, R. Uzsoy: Minimizing Total Completion Time on a Batch Processing Machine with Job Families. O. R. Lett. 13 (1993b) 61–65.

4. Lect Notes Comput Sci;X. Deng,1999

5. Lect Notes Comput Sci;X. Deng,20001

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

1. Level based batch scheduling strategy with idle slot reduction under DAG constraints for computational grid;Journal of Systems and Software;2015-10

2. A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor;The International Journal of Advanced Manufacturing Technology;2006-01-18

3. Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine;Theoretical Computer Science;2005-11

4. A PTAS for Semiconductor Burn-in Scheduling;Journal of Combinatorial Optimization;2005-02