4 citations · 4 across the 1 of their papers we have counts for
1 paper
N. Fogarasi, K. Tornai, J. Levendovszky
This paper explores fast, polynomial time heuristic approximate solutions to the NP-hard problem of scheduling jobs on N identical machines. The jobs are independent and are allowe…