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
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...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
AbstractWe study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at unp...
Abstract. We study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at u...
This paper considers the non-preemptive on-line load balancing problem where tasks have limited dura...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
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...
AbstractWe consider the on-line load balancing problem where there are m identical machines (servers...
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 ...
AbstractThe setup for our problem consists of n servers that must complete a set of tasks. Each task...
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...
We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We d...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
AbstractWe study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at unp...
Abstract. We study load balancing problems of temporary jobs (i.e., jobs that arrive and depart at u...
This paper considers the non-preemptive on-line load balancing problem where tasks have limited dura...
In this paper we study the problem of on-line allocation of routes to virtual circuits (both point-t...
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...
AbstractWe consider the on-line load balancing problem where there are m identical machines (servers...
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 ...
AbstractThe setup for our problem consists of n servers that must complete a set of tasks. Each task...
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...
We consider the problem of scheduling permanent jobs on related machines in an on-line fashion. We d...
AbstractIn this paper we consider the temporary tasks assignment problem. In this problem, there are...
DOI
Add to ORKG