Abstract
Scheduling a batch processing system has been extensively studied in the last decade. A batch processing system is modelled as a machine that can process up to b jobs simultaneously as a batch. The scheduling problem involves assigning all n jobs to batches and determining the batch sequence in such a way that certain objective function of job completion times C j is minimized. In this paper, we address the scheduling problem under the on-line setting in the sense that we construct our schedule irrevocably as time proceeds and do not know of the existence of any job that may arrive later. Our objective is to minimize the total weighted completion time ∑w j C j. We provide a linear time on-line algorithm for the unrestrictive model (i.e., b ≥ n) and show that the algorithm is 10/3-competitive. For the restrictive model (i.e., b < n), we first consider the (off-line) problem of finding a maximum independent vertex set in an interval graph with cost constraint (MISCP), which is NP-hard. We give a dual fully polynomial time approximation scheme for MISCP, which leads us to a (4 + ∈)-competitive on-line algorithm for any ∈ > 0 for the original on-line scheduling problem. These two on-line algorithms are the first deterministic algorithms of constant performance guarantees.
Similar content being viewed by others
References
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.
S. Chakrabarti, C.A. Phillips, A.S. Schulz, D.B. Shmoys, C. Stein, and J. Wein, “Improved scheduling algorithms for minsum criteria,” in Automata, Languages and Programming, F. Meyer auf der Heide and B. Monien (Eds.), Lecture Notes in Computer Science 1099, Springer: Berlin, 1996, pp. 646–657.
V. Chandru, C.-Y. Lee, and R. Uzsoy, “Minimizing total completion time on batch processing machines,” International Journal of Production Research, vol. 31, pp. 2097–2121, 1993a.
V. Chandru, C.-Y. Lee, and R. Uzsoy, “Minimizing total completion time on a batch processing machine with job families,” Operations Research Letters, vol. 13, pp. 61–65, 1993b.
X. Deng, H. Feng, G. Li, and G. Liu, “A PTAS for minimizing total completion time of bounded batch scheduling,” To appear in International Journal of Foundations of Computer Science.
X. Deng, H. Feng, P. Zhang, and H. Zhu, “A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling,” in 12th International Symposium on Algorithms and Computation, LNCS 2223, Christchurch, New Zealand, December 2001, pp. 26–35.
X. Deng and Y. Zhang, “Minimizing mean response time in a batch processing system, COCOON99,” Lecture Notes in Computer Science, vol. 1627, pp. 231–240, 1999.
L.A. Hall, A.S. Schulz, D.B. Shmoys, and J. Wein, “Scheduling to minimize average completion time: Off-line and on-line approximation algorithms,” Mathematics of Operations Research, vol. 22, pp. 513–544, 1997.
R. Hassin, “Approximation schemes for the restricted shortest path problem,” Mathematics of Operations Research, vol. 17, pp. 36–42, 1992.
D.S. Hochbaum and D. Landy, “Scheduling semiconductor burn-in operations to minimize total flowtime,” Operations Research, vol. 45, pp. 874–885, 1997.
Y. Ikura and M. Gimple, “Efficient scheduling algorithms 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,” Preprint, 1996.
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, pp. 129–136, 2000.
C.N. Potts and M.Y. Kovalyov, “Scheduling with batching: A review,” European Journal of Operational Research, vol. 120, pp. 228–249, 2000.
C.S. Sung and Y.I. Choung, “Minimizing makespan on a single burn-in oven in semiconductor manufacturing,” European Journal of Operational Research, vol. 120, pp. 559–574, 2000.
R. Uzsoy, “Scheduling batch processing machines with incompatible job families,” International Journal of Production Research, vol. 33, pp. 2685–2708, 1995.
A.P.A. Vestjens, “On-line machine scheduling,” Ph.D. Dissertation, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, B., Deng, X. & Zang, W. On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. Journal of Combinatorial Optimization 8, 85–95 (2004). https://doi.org/10.1023/B:JOCO.0000021939.01674.1f
Issue Date:
DOI: https://doi.org/10.1023/B:JOCO.0000021939.01674.1f