A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling
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.
KeywordsCompletion Time Release Time Optimal Schedule Total Completion Time Polynomial Time Approximation Scheme
Unable to display preview. Download preview PDF.
- 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
- 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.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
- 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