Variants of Multi-resource Scheduling Problems with Equal Processing Times


We tackle the problem of non-preemptive scheduling of a set of tasks of duration p over m machines with given release and deadline times. We present a polynomial time algorithm as a generalization to this problem, when the number of machines fluctuates over time. Further, we consider different objective functions for this problem. We show that if an… (More)
DOI: 10.1007/978-3-319-26626-8_7


2 Figures and Tables