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.
This research was supported in part by an RGC CERG grant (Project #: 9040597) of the Research Grants Council of Hong Kong Special Admini strative REgion, China, and an SRG grant of City University of Hong Kong (Project #: 7001040).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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).
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.
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).
D.S. Hochbaum and D. Landy, Scheduling semiconductor burn-in operations to minimize total flowtime, Operations Research 45 (1997), 874–885.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, X., Feng, H., Zhang, P., Zhu, H. (2001). A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-45678-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42985-2
Online ISBN: 978-3-540-45678-0
eBook Packages: Springer Book Archive