By Debasis Dwibedy and Rakesh Mohanty

We study the computational complexity of the non-preemptive scheduling problem of a list of independent jobs on a set of identical parallel processors with a makespan minimization objective. We make a maiden attempt to explore the combinatorial structure showing the exhaustive solution space of the problem by defining the \textit{Scheduling... Show more

January 21, 2022

Loading full text...

Similar articles

Loading recommendations...

x1

A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree

Click on play to start listening