84 citations · 241 across the 22 of their papers we have counts for
34 papers
Efficient approximation schemes for scheduling on a stochastic number of machines
Leah Epstein, Asaf Levin
We study three two-stage optimization problems with a similar structure and different objectives. In the first stage of each problem, the goal is to assign input jobs of positive s…
APTAS for bin packing with general cost structures
G. Jaykrishnan, Asaf Levin
We consider the following generalization of the bin packing problem. We are given a set of items each of which is associated with a rational size in the interval [0,1], and a monot…
Scheduling with cardinality dependent unavailability periods
G. Jaykrishnan, Asaf Levin
We consider non-preemptive scheduling problems on parallel identical machines where machines change their status from being available to being unavailable and vice versa along the…
EPTAS for the dual of splittable bin packing with cardinality constraint
G. Jaykrishnan, Asaf Levin
The problem considered is the splittable bin packing with cardinality constraint. It is a variant of the bin packing problem where items are allowed to be split into parts but the…
The near exact bin covering problem
Asaf Levin
We present a new generalization of the bin covering problem that is known to be a strongly NP-hard problem. In our generalization there is a positive constant , and we are given…
Cardinality Constrained Scheduling in Online Models
Leah Epstein, Alexandra Lassota, Asaf Levin +2
Makespan minimization on parallel identical machines is a classical and intensively studied problem in scheduling, and a classic example for online algorithm analysis with Graham's…