Advertisement

A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling

  • Xiaotie Deng
  • Haodi Feng
  • Pixing Zhang
  • Hong Zhu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)

Abstract

We study the unbounded batch machine scheduling of n jobs to minimize the total completion time.A batch machine can handle up to B ≥ n jobs simultaneously.Eac h job is characterized by a release(arrival) time and a processing time.J obs processed in the same batch have the same completion time.(i.e., their common starting time plus the processing time of the longest job in the batch.) For batch processing, nonpreemptive scheduling is usually required and we focus on this case.I n this paper, we establish a polynomial time approximation scheme for it.

Keywords

Completion Time Release Time Optimal Schedule Total Completion Time Polynomial Time Approximation Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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, and 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, Oct.1999, New York, pp 32–43.Google Scholar
  2. 2.
    P. Brucker, A. Gladky, H. Hoogeveen, M. Kovalyov, C. Potts, T. Tautenhahn, and S. van de Velde, Scheduling a batching machine, Journal of Scheduling, 1, pp.31–54, (1998).MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    X. Deng, Y. Zhang, Minimizing Mean Response Time in Batch Processing Systme, COCOON’99, Volume 1627 of Lecture Notes in Computer Science, pages 231–240, Tokyo, Japan, July 1999. Springer-verlag.Google Scholar
  4. 4.
    R.L. Grah am, E. L. Lawler, J. K. Lenstra, and A.H. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Math.5( 1979).Google Scholar
  5. 5.
    D.S. Hochbaum and D. Landy, Scheduling semiconductor burn-in operations to minimize total flowtime, Operations Research 45 (1997), 874–885.CrossRefMATHGoogle Scholar
  6. 6.
    C. Y.Lee and R. Uzsoy, Minimizing makespan on single batch processing machine with dynamic job arrivals, Research Report, Dept.Indus trial and System Engineering, Univ.Florid a, Jan, 1996.Google Scholar
  7. 7.
    C.Y. Lee, R. Uzsoy and L.A. Mart in Vega. Efficient algorithms for scheduling semiconductor burn-in operations.Op erations Research, 40:764–775, 1992.CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Xiaotie Deng
    • 1
  • Haodi Feng
    • 1
  • Pixing Zhang
    • 2
  • Hong Zhu
    • 2
  1. 1.Department of Computer ScienceCity University of Hong KongHong Kong
  2. 2.Department of Computer ScienceFudan UniversityChina

Personalised recommendations