Online scheduling with a buffer on related machines

György Dósa () and Leah Epstein ()
Additional contact information
György Dósa: University of Pannonia
Leah Epstein: University of Haifa

Journal of Combinatorial Optimization, 2010, vol. 20, issue 2, No 4, 179 pages

Abstract: Abstract Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to parallel machines. A buffer of a fixed capacity K is available for storing at most K input jobs. An arriving job must be either assigned to a machine immediately upon arrival, or it can be stored in the buffer for unlimited time. A stored job which is removed from the buffer (possibly, in order to allocate a space in the buffer for a new job) must be assigned immediately as well. We study the case of two uniformly related machines of speed ratio s≥1, with the goal of makespan minimization. Two natural questions can be asked. The first question is whether this model is different from standard online scheduling, that is, is any size of buffer K>0 already helpful to the algorithm, compared to the case K=0. The second question is whether there exists a constant K, so that a larger buffer is no longer beneficial to an algorithm, that is, increasing the size of the buffer above this threshold would not change the best competitive ratio further. Previous work (Kellerer et al., Oper. Res. Lett. 21, 235–242, 1997; Zhang, Inf. Process. Lett. 61, 145–148, 1997; Englert et al., Proc. 48th Symp. Foundations of Computer Science (FOCS), 2008) shows that in the case s=1, already K=1 allows to design a $\frac{4}{3}$ -competitive algorithm, which is best possible for any K≥1, whereas the best possible ratio for K=0 is $\frac{3}{2}$ . Similar results have been show for multiple identical machines (Englert et al., Proc. 48th Symp. Foundations of Computer Science (FOCS), 2008). We answer both questions affirmatively, and show that a buffer of size K=2 is sufficient to achieve the a competitive ratio which matches the lower bound for K→∞ for any s>1. In fact, we show that a buffer of size K=1 can evidently be exploited by the algorithm for any s>1, but for a range of values of s, it is still weaker than a buffer of size 2. On the other hand, in the case s≥2, a buffer of size K=1 already allows to achieve optimal bounds.

Keywords: Semi-online algorithms; Scheduling; Uniformly related machines (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9200-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:20:y:2010:i:2:d:10.1007_s10878-008-9200-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9200-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().