Azar Yossi

Yossi Azar

Information about the author Yossi Azar will soon be added to the site.
Found 11 papers in total
Scheduling with Deadlines and Buffer Management with Processing Requirements
Scheduling with Deadlines and Buffer Management with Processing Requirements
2017
We discuss the well known online job scheduling problem with release times and...
Optimal Coordination Mechanisms for Unrelated Machine Scheduling
Optimal Coordination Mechanisms for Unrelated Machine Scheduling
2015
We investigate the influence of different algorithmic choices on the approximation...
A preemptive algorithm for maximizing disjoint paths on trees
A preemptive algorithm for maximizing disjoint paths on trees
2010
We consider the on-line version of the maximum vertex disjoint path problem when the...
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
2003
We consider the maximum disjoint paths problem and its generalization, the call...
Minimizing total flow time and total completion time with immediate dispatching
Minimizing total flow time and total completion time with immediate dispatching
2007
We consider the problem of scheduling jobs arriving over time in a multiprocessor...
Combinatorial algorithms for unsplittable flow problem
Combinatorial algorithms for unsplittable flow problem
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that...
Fair versus unrestricted bin packing
Fair versus unrestricted bin packing
2002
We consider the on-line Dual Bin Packing problem where we have n unit size bins and a...
Maximizing job benefits on-line
Maximizing job benefits on-line
2001
We consider a benefit model for on-line preemptive scheduling. In this model jobs...
Resource augmentation in load balancing
Resource augmentation in load balancing
2000
We consider load balancing in the following setting. The on-line algorithm is allowed...
Approximation schemes for scheduling on parallel machines
Approximation schemes for scheduling on parallel machines
1998
We discuss scheduling problems with m identical machines and n jobs where each job has...
On-line machine covering
On-line machine covering
1998
We consider the problem of scheduling a sequence of jobs on m parallel identical...
Papers per page: