Using dual approximation algorithms for scheduling problems theoretical and practical results

The problem of scheduling a set of n jobs on m identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard ...