Abstract
We study the problem of on-line scheduling jobs with release dates on a batch machine of finite capacity with the objective of minimizing the makespan. We generalize several existing algorithms for the problem to a class of on-line algorithms that are 2-competitive for any arbitrary finite machine capacity. Then, we show that one of these generalized algorithms is in fact 7/4-competitive for machine capacity 2. This is the first on-line algorithm for a finite machine capacity with competitive ratio less than 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.H. Ahmadi, R.H. Ahmadi, S. Dasu, and C.S. Tang, “Batching and scheduling jobs on batch and discrete processors,” Operations Research, vol. 40, pp. 750–763, 1992.
S. Albers and P. Brucker, “The complexity of one-machine batching problems,” Discrete Applied Mathematics, vol. 47, pp. 87–107, 1993.
A. Borodin and R. El-yaniv, Online Computation and Vompetitive Analysis, Cambridge University Press, 1998.
P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde, “Scheduling a batching machine,” Journal of Scheduling, vol. 1, pp. 31–54, 1998.
X. Deng, C. K. Poon, and Y. Zhang, “Approximation algorithms in batch processing,” Journal of Combinatorial Optimizations, vol. 7, no. 3, pp. 247–257, 2003.
R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.
Y. Ikura and M. Gimple, “Scheduling algorithm for a single batch processing machine,” Operations Research Letters, vol. 5, pp. 61–65, 1986.
C.Y. Lee and R. Uzsoy, “Minimizing makespan on a single batch processing machine with dynamic job arrivals,” International Journal of Production Research, vol. 37, no. 1, pp. 219–236, 1999.
C.Y. Lee, R. Uzsoy, and L.A. Martin Vega, “Efficient algorithms for scheduling semiconductor burn-in operations,” Operations Research, vol. 40, pp. 764–775, 1992.
Z. Liu and W. Yu, “Scheduling one batch processor subject to job release dates,” Discrete Applied Mathematics, vol. 105, nos. 1–3, pp. 129–136, 2000.
C. K. Poon and P. Zhang, “Minimizing makespan in batch machine scheduling,” Algorithmica, vol. 39, no. 2, pp. 155–174, 2004.
C.K. Poon and W. Yu, “A flexible on-line scheduling algorithm for batch machine with infinite capacity,” in 5th International Conference on Optimization: Techniques and Applications (ICOTA’01), Hong Kong, December 2001.
C.H. Potts and M.Y. Kovalyov, “Scheduling with batching: A review,” European Journal of Operational Research, vol. 120, pp. 228–249, 2000.
R. Uzsoy, “Scheduling a single batch processing machine with nonidentical job sizes,” International Journal of Production Research, vol. 32, pp. 1615–1635, 1994.
S. Webster and K. Baker. “Scheduling groups of jobs on a single machine,” Operations Research, vol. 43, no, 4, pp. 692–703, 1995.
G. Zhang, X. Cai, and C.K. Wong. “On-line algorithms for minimizing makespan on batch processing machines,” Naval Research Logistics, vol. 48, no. 3, pp. 241–258, 2001.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is substantially supported by a grant from City Univ. of Hong Kong (Grant No. 7001119). The second author is supported by this grant and by the Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Poon, C.K., Yu, W. On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity. J Comb Optim 9, 167–186 (2005). https://doi.org/10.1007/s10878-005-6855-5
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-6855-5