Minimizing the number of machines for scheduling jobs with equal processing times

What is it about?

We consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. We construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal in polynomial time.

Featured Image