考虑第二优化目标的动态单机排序问题  

BICRITERIA DYNAMIC SINGLE- MACHINE SCHEDULING PROBLEMS

作　　者：项思明[1] 

机构地区：[1]安徽建筑工业学院经济系

出　　处：《安徽建筑工业学院学报（自然科学版）》1998年第2期52-55,共4页Journal of Anhui Institute of Architecture(Natural Science)

摘　　要：对以最大滞后时间以及带权加工时间和为第二优化目标的动态单机排序问题１｜ｒｊ｜Ｃｍａｘ分别进行了探讨，并给出了相应的多项式算法。It has been a new trend of the scheduling theory to study scheduling problems with multi-criteria objectives. In this paper we consider the dynamic single machine scheduling problem 1/r j/c max with the maximal tardiness and the weighted sum of job completion times as a secondary criterion respectively. Also, we represent the polynomial algorithms relevant to these cases.

关 键 词：动态排序 多目标优化 多项式算法 

分 类 号：O223[理学—运筹学与控制论]