A simple algorithm for scheduling equal sized jobs on parallel machines with release times and deadlines


Given n jobs of equal processing time p, we wish to find a schedule on m parallel machines, where each job j is scheduled in a given interval [rj , Dj). This problem can be solved in time O(n logn) by a complicated algorithm by Simons from 1978. Recently Brucker and Kravchenko (2005), gave a different algorithm for it. Based in their approach we provide an… (More)


2 Figures and Tables

Slides referencing similar topics