Skip to main content
SpringerLink
Log in

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2337))

Abstract

We consider a batch processing system {p i: i = 1, 2,..., n} where p i is the processing time of job i, and up to B jobs can be processed together such that the handling time of a batch is the longest processing time among jobs in the batch. The number of job types m is not fixed and all the jobs are released at the same time. Jobs are executed non-preemptively. Our objective is to assign jobs to batches and sequence the batches so as to minimize the total completion time. The best previously known result is a 2—approximation algorithm due to D. S. Hochbaum and D. Landy [6]. In this paper, we establish the first polynomial time approximation scheme (PTAS) for the problem.

Research is partially supported by a grant from the Research Grants Council of Hong Kong SAR (CityU 1056/01E) and a grant from CityU of Hong Kong (Project No.7001215).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  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.

    Article  MathSciNet  MATH  Google Scholar 

  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.

    Article  MathSciNet  MATH  Google Scholar 

  4. X. Deng, Y. Zhang: Minimizing Mean Response Time in Batch Processing System. Lecture Notes in Computer Science, Springer-Verlag 1627 (COCOON’99, Tokyo, Japan, July 1999), 231–240.

    Google Scholar 

  5. X. Deng and H. Feng, P. Zhang and H. Zhu: A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. In proceeding of ISAAC’01, LNCS 2223, 26–35.

    Google Scholar 

  6. D. S. Hochbaum, D. Landy: Scheduling Semiconductor Burn-in Operations to Minimize Total Flowtime. Operations Research 45(6) (1997) 874–885.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Systems Science, Academy of Siences, Beijing, China

    Mao-Cheng Cai

  2. Department of Computer Science, City University of Hong Kong, sHong Kong

    Xiaotie Deng & Haodi Feng

  3. School of Mathematics and System Science, Shandong University, Jinan, 250100

    Guojun Li & Guizhen Liu

Authors
  1. Mao-Cheng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaotie Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haodi Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guojun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Guizhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Program in Applied and Computational Mathematics, University of Princeton, Fine Hall, Washington Road, Princeton, NJ, 08544-1000, USA

    William J. Cook

  2. Sloan School of Management, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA, 02139-4307, USA

    Andreas S. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, MC., Deng, X., Feng, H., Li, G., Liu, G. (2002). A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. In: Cook, W.J., Schulz, A.S. (eds) Integer Programming and Combinatorial Optimization. IPCO 2002. Lecture Notes in Computer Science, vol 2337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47867-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-47867-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43676-8

  • Online ISBN: 978-3-540-47867-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation