AbstractWe study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at unpredictable time) in two different contexts, namely, machines and network paths. Such problems are known as machine load balancing and virtual circuit routing in the literature. We present new on-line algorithms and improved lower bounds
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
In this paper we consider the temporary tasks assignment problem. In this problem, there are m paral...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
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...
This paper considers the non-preemptive on-line load balancing problem where tasks have limited dura...
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of t...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of ...
AbstractWe consider the on-line load balancing problem where there are m identical machines (servers...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted as...
We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We d...
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
AbstractThe fundamental problems in dynamic load balancing and job scheduling in parallel and distri...
AbstractWe provide a new approach to the on-line load balancing problem in the case of restricted as...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
In this paper we consider the temporary tasks assignment problem. In this problem, there are m paral...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
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...
This paper considers the non-preemptive on-line load balancing problem where tasks have limited dura...
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of t...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
Among all basic on-line load balancing problems, the only unresolved problem was load balancing of ...
AbstractWe consider the on-line load balancing problem where there are m identical machines (servers...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted as...
We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We d...
We provide a new approach to the on-line load balancing problem in the case of restricted assignment...
AbstractThe fundamental problems in dynamic load balancing and job scheduling in parallel and distri...
AbstractWe provide a new approach to the on-line load balancing problem in the case of restricted as...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
In this paper we consider the temporary tasks assignment problem. In this problem, there are m paral...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
DOI
Add to ORKG