برنامه ریزی مسائل بر پایه بهینه بودن الگوریتم دقیق و تقریبی We consider the classical scheduling problem on parallel identical machines to minimize the makespan. There is a long history of study on this problem, focusing on exact and approximation algorithms. It is thus natural to consider whether these algorithms …
ادامه مطلبOn the optimality of exact and approximation algorithms for scheduling problems
