It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method, thus these four types of problems can be solved in polynomial time.
It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method, thus these four types of problems can be solved in polynomial time.
用数学规划的方法证明了四类多准则下的单机排序问题可以转化为指派问题，从而这四类问题都多项式时间可解。