Advertisement

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling

  • Mao-Cheng Cai
  • Xiaotie Deng
  • Haodi Feng
  • Guojun Li
  • Guizhen Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 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.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 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. 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. 6.
    D. S. Hochbaum, D. Landy: Scheduling Semiconductor Burn-in Operations to Minimize Total Flowtime. Operations Research 45(6) (1997) 874–885.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mao-Cheng Cai
    • 1
  • Xiaotie Deng
    • 2
  • Haodi Feng
    • 2
  • Guojun Li
    • 3
  • Guizhen Liu
    • 3
  1. 1.Institute of Systems ScienceAcademy of SiencesBeijingChina
  2. 2.Department of Computer ScienceCity University of Hong KongsHong Kong
  3. 3.School of Mathematics and System ScienceShandong UniversityJinan

Personalised recommendations