Abstract
We study a variant of the on-line scheduling problem on two parallel processors. The size of the items is unknown and, as soon as an item is released, it must be immediately assigned to a processor and the assignment cannot be changed later. Optimal algorithms (with respect to competitive ratio) are known for some variants of this problem, where some partial information is given on the instance: the sum of the items is known, or a buffer is available to store a finite number of items. In these cases the best possible competitive ratio of the algorithms is 4/3. In this paper we assume that the sum of items is known in advance (supposed to equal 2) and also that the size of items does not exceed a fixed upper bound γ < 1. We provide, for all the possible values of γ, a lower bound for the competitive ratio of any algorithm and propose different algorithms, for different ranges of the upper bound, for which a worst-case analysis is provided. The proposed algorithms are optimal for ½ \le γ \le 3/5, γ=¾ and 16/17 \le γ < 1.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Albers (1999) ArticleTitleBetter bounds for online scheduling SIAM J. Comput. 29 459–473 Occurrence Handle10.1137/S0097539797324874 Occurrence Handle1717919
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Angelelli, E., Speranza, M. & Tuza, Z. Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. Algorithmica 37, 243–262 (2003). https://doi.org/10.1007/s00453-003-1037-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1037-2