84 citations · 182 across the 26 of their papers we have counts for
37 papers
Parallel solutions for ordinal scheduling with a small number of machines
Leah Epstein
We study ordinal makespan scheduling on small numbers of identical machines, with respect to two parallel solutions. In ordinal scheduling, it is known that jobs are sorted by non-…
Parallel solutions for preemptive makespan scheduling on two identical machines
Leah Epstein
We consider online preemptive scheduling of jobs arriving one by one, to be assigned to two identical machines, with the goal of makespan minimization. We study the effect of selec…
Bin stretching with migration on two hierarchical machines
Islam Akaria, Leah Epstein
In this paper, we consider semi-online scheduling with migration on two hierarchical machines, with the purpose of minimizing the makespan. The meaning of two hierarchical machines…
Lower bounds on the performance of online algorithms for relaxed packing problems
János Balogh, György Dósa, Leah Epstein +1
We prove new lower bounds for suitable competitive ratio measures of two relaxed online packing problems: online removable multiple knapsack, and a recently introduced online minim…
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…
Several methods of analysis for cardinality constrained bin packing
Leah Epstein
We consider a known variant of bin packing called {\it cardinality constrained bin packing}, also called {\it bin packing with cardinality constraints} (BPCC). In this problem, the…