Abstract
In this paper a polynomial time approximation scheme, PTAS for short, is presented for the problem of scheduling jobs in a batch processing system. Each job has a pre-defined release date, which indicates when the job is available, and a pre-defined burn-in time, which is the least time needed for processing the job. At one time, at most B jobs can be processed together, where B is a pre-given number. No preemption is permitted.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S.Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, “Approximation schemes for minimizing average weighted completion time withrelease dates” in Proceedingof the40th Annual Symposium on Foundations of Computer Science, New York,1999, pp. 32–43.
K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, 1974.
P. Brucker, A. Gladky, H. Hoogeveen, M. Kovalyov, C. Potts, T. Tautenhahn, and S. van de Velde, “Scheduling a batching machine” Journal of Scheduling, vol. 1, pp. 31–54, 1998.
V. Chandru, C.Y. Lee, and R. Uzsoy, “Minimizing total completion time on a batch processing machine with job families” O. R. Lett., vol. 13, pp. 61–65, 1993.
M. Cai, X. Deng, H. Feng, G. Li, and G. Liu, “A PTAS for minimizing total completion time of bounded batch scheduling” Lecture Notes in Computer Science 2337 (IPCO’2002), MIT, pp. 304–314, 2002.
Bo Chen, Xiaotie Deng, and Wenan Zang, “Online schedulinga batch processing system to minimize total weighted job completion time”Journal of Combinatorial Optimization, vol. 8, pp. 85–95, 2004.
V. Chandru, C. Lee, and R. Uzsoy, “Minimizing total completion time on a batch processing machine with job families” Operations Research Letters, vol. 13, pp. 61–65, 1993.
X.T. Deng, H.D. Feng, P.X. Zhang, Y.Z. Zhang, and H. Zhu, “Minimizing mean completion time in a batch processing system” Algorithmica, vol. 38, pp. 513–528, 2004.
R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling” Annals of Discrete Math, vol. 5, 1979.
D.S. Hochbaum and D. Landy, “Scheduling semiconductor burn-in problem operations to minimize total flowtime” Operations Research, vol. 45, pp. 874–885, 1997.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by an RGC CERG grant [CityU 1081/02E] and a grant from CityU [7001347].
Supported by the fund from NSFC under grant numbers 10271065 and 60373025.
Rights and permissions
About this article
Cite this article
Deng, X., Feng, H., Li, G. et al. A PTAS for Semiconductor Burn-in Scheduling. J Comb Optim 9, 5–17 (2005). https://doi.org/10.1007/s10878-005-5480-7
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-5480-7