Necessary and sufficient conditions of optimality for some classical scheduling problems

A scheduling problem is generally to order the jobs such that a certain objective function f(π) is minimized. For some classical scheduling problems, only sufficient conditions of optimal solutions are concerned in the literature. In this paper, we study the necessary and sufficient conditions by means of the concept of critical ordering (critical jobs and their relations). These results are meaningful in recognition and characterization of optimal solutions of scheduling problems.