Add to ORKGAmong all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem exists for almost a decade, see [Borodin El-Yaniv]. We resolve this problem by providing an unapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the o-line problem with a xed number of machines and show a 2 unapproximability for the general case
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
A key point in parallel systems design is the way clients requests are forwarded and distributed amo...
textabstractWe consider the problem of scheduling jobs online, where jobs may be served partially in...
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of t...
This paper considers the non-preemptive on-line load balancing problem where tasks have limited dura...
AbstractWe consider the on-line load balancing problem where there are m identical machines (servers...
Abstract. In this paper we consider the temporary tasks assignment problem. In this problem, there a...
Abstract. We study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at u...
AbstractWe study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at unp...
We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We d...
In this paper we consider the temporary tasks assignment problem. In this problem, there are m paral...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted as...
AbstractWe provide a new approach to the on-line load balancing problem in the case of restricted as...
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
A key point in parallel systems design is the way clients requests are forwarded and distributed amo...
textabstractWe consider the problem of scheduling jobs online, where jobs may be served partially in...
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of t...
This paper considers the non-preemptive on-line load balancing problem where tasks have limited dura...
AbstractWe consider the on-line load balancing problem where there are m identical machines (servers...
Abstract. In this paper we consider the temporary tasks assignment problem. In this problem, there a...
Abstract. We study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at u...
AbstractWe study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at unp...
We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We d...
In this paper we consider the temporary tasks assignment problem. In this problem, there are m paral...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted as...
AbstractWe provide a new approach to the on-line load balancing problem in the case of restricted as...
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
A key point in parallel systems design is the way clients requests are forwarded and distributed amo...
textabstractWe consider the problem of scheduling jobs online, where jobs may be served partially in...