Necessary and sufficient conditions of optimality for some classical scheduling problems
Necessary and sufficient conditions of optimality for some classical scheduling problems
复制标题
DOI：
10.1016/j.ejor.2005.09.017
复制
发表时间：
2007-01
期刊：
影响因子：
--
通讯作者：
Yixun Lin;Xiumei Wang
中科院分区：
文献类型：
--
作者：
Yixun Lin;Xiumei Wang
调度问题通常是对作业进行排序，以使某个目标函数 f(π) 最小化。对于一些经典的调度问题，文献中只关注最优解的充分条件。在本文中，我们通过关键顺序（关键工作及其关系）的概念来研究充分必要条件。这些结果对于识别和表征调度问题的最优解具有重要意义。
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.