An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling
SIAM Journal on Computing
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The competitiveness of on-line assignments
Journal of Algorithms
On-line load balancing of temporary tasks
Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
An improved lower bound for load balancing of tasks with unknown duration
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line Load Balancing for Related Machines
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Improved Bounds for On-line Load Balancing
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Developments from a June 1996 seminar on Online algorithms: the state of the art
On-Line Load Banancing in a Hierarchical Server Topology
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
On-Line Load Balancing of Temporary Tasks on Identical Machines
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We study load balancing problems with 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.