Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482417 | European Journal of Operational Research | 2007 | 10 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yixun Lin, Xiumei Wang,