Emergent Mind
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
(1708.06048)
Published Aug 21, 2017
in
cs.DS
Abstract
We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with non-identical capacities where each job can only be processed on a specified subset of machines called its processing set. For the case of equal release times, we give efficient exact algorithms for various objective functions. For the case of unequal release times, we give efficient exact algorithms for minimizing makespan.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.