Abstract.
For most scheduling problems the set of machines is fixed initially and remains unchanged. Recently Imreh and Noga proposed adding the concept of machine cost to scheduling problems and considered the so-called List Model problem. For this problem, we are given a sequence of independent jobs with positive sizes, which must be processed non-preemptively on a machine. No machines are initially provided, and when a job is revealed the algorithm has the option to purchase new machines. The objective is to minimize the sum of the makespan and cost of machines. In this paper, a modified model of List Model is presented where preemption is allowed. For this model, it is shown that better performance is possible. We present an online algorithm with a competitive ratio of \((2\sqrt{6} + 2)/5\approx 1.3798\) while the lower bound is 4/3. For the semi-online problem with decreasing sizes, we design an optimal algorithm with a competitive ratio of 4/3, which improves the known upper bound of 3/2. The algorithm does not introduce any preemption, and hence is also an optimal semi-online algorithm for the non-preemptive semi-online problem. For the semi-online problem with known largest size, we present an optimal algorithm with a competitive ratio of 4/3.
Similar content being viewed by others
References
Cai, S.Y., He, Y. (2003) Semi-online algorithms for scheduling non-increasing processing jobs with processor cost. Acta Automatica Sinica 29: 917-921 (in Chinese)
Chen, B., van Vliet, A., Woeginger, G. (1995) An optimal algorithm for preemptive on-line scheduling. Operations Research Letters 18: 127-131
Dósa, G., He, Y. (2004) Better on-line algorithms for scheduling with machine cost. SIAM Journal on Computing 33: 1035-1051
Dósa, G., He, Y. (2004) Semi-online algorithms for parallel machine scheduling problems. Computing 72: 355-363
Epstein, L. (2003) Bin stretching revisited. Acta Informatica 39: 97-117
Graham, R.L. (1969) Bounds on multiprocessing finishing anomalies. SIAM Journal on Applied Mathematics 17: 416-429
He, Y., Cai, S.Y. (2002) Semi-online scheduling with machine cost. Journal of Computer Science and Technology 17: 781-787
He, Y., Jiang, Y.W. (2004) Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. Acta Informatica 40: 367-383
He, Y., Zhang, G. (1999) Semi-online scheduling on two identical machines. Computing 62: 179-187
Imreh, C., Noga, J. (1999) Scheduling with machine cost. In: Proc. of RANDOM-APPROX’99 (Lecture Notes in Computer Science 1671). Springer, Berlin Heidelberg New York 1999, pp. 168-176
Kellerer, H., Kotov, V., Speranza, M.R., Tuza, Z. (1997) Semi on-line algorithms for the partition problem. Operations Research Letters 21: 235-242
Panwalker, S., Liman, S.D. (2002) Single operation earliness-tardiness scheduling with machine activation costs. IIE Transactions 34: 509-513
Seiden, S. (2000) A guessing game and randomized online algorithms. In: Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, ACM, New York 2000, pp. 592-601
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 7 June 2004, Published online: 11 November 2004
This research is supported by the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of MOE, China, and National Natural Science Foundation of China (10271110, 60021201).
Rights and permissions
About this article
Cite this article
Jiang, Y., He, Y. Preemptive online algorithms for scheduling with machine cost. Acta Informatica 41, 315–340 (2005). https://doi.org/10.1007/s00236-004-0156-9
Issue Date:
DOI: https://doi.org/10.1007/s00236-004-0156-9