1 citations · 1 across the 5 of their papers we have counts for
5 papers
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…
EPTAS for parallel identical machine scheduling with time restrictions
G. Jaykrishnan, Asaf Levin
We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B differe…
EPTAS for load balancing problem on parallel machines with a non-renewable resource
G. Jaykrishnan, Asaf Levin
The problem considered is the non-preemptive scheduling of independent jobs that consume a resource (which is non-renewable and replenished regularly) on parallel uniformly related…