activity
20192026
most citedOnline Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems

4 citations · 5 across the 12 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

cs.DS2022

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

Debasis Dwibedy, 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…