期刊文献+

多目标排序中的若干结果

Some results of multicriteria scheduling
在线阅读 下载PDF
导出
摘要 对有k个代理(客户)的多目标排序问题进行了研究,并给出其计算复杂性. This paper introduces multicriteria scheduling with k agents (customers)and gives their computational complexity.
作者 冯琪 张卯
出处 《周口师范学院学报》 CAS 2006年第5期15-16,26,共3页 Journal of Zhoukou Normal University
关键词 排序 多目标 计算复杂性 scheduling multicriteria computational complexity
  • 相关文献

参考文献7

  • 1Brucker P.Scheduling Algorithms[M].Third Edition.Berlin:Springer-Verlag,2001.
  • 2Baker K R,Smith J C.A multiple-criterion model for machine scheduling[J].Journal of Scheduling,2003(6):7-16.
  • 3Hall N G,Potts C N.Rescheduling for new orders[J].Opeartions Research,2004,52:440-453.
  • 4Chen C L,Bulfin R L.Complexity of single machine,multi-criteria scheduling problems[J].European Journal of Operational Research,1993,70:115-125.
  • 5Lenstra J K,Rinnooy Kan A H G,Brucker P.Complexity of machine scheduling problems[J].Annals of Discrete Mathematics,1997(1):343-362.
  • 6Gupta J N D,Hariri A M A,Potts C N.Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs[J].Annals of Operations Research,1999,92:107-123.
  • 7Agnetis A,Mirchandani P B,Pacciarelli D,et al.Scheduling problems with two competing agents[J].Opeartions Research,2004,52:229-242.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部