期刊文献+

一个多项式时间可解的自由作业排序问题 被引量:1

原文传递
导出
摘要 一个多项式时间可解的自由作业排序问题俞国胜(上海大学理学院数学系,上海201800)1引言和记号自由作业(oPerlshoP)排序问题是:有n个工件J一《JI,人,··,人}和。台机器M一{MI,MZ,…;Mtn},每个工件Jj需要在机器Mi上加工,...
作者 俞国胜
出处 《应用数学学报》 CSCD 北大核心 1996年第3期469-472,共4页 Acta Mathematicae Applicatae Sinica
  • 相关文献

参考文献3

二级参考文献3

  • 1Guochun Tang. A new branch and bound algorithm for minimizing the weighted number of tardy jobs[J] 1990,Annals of Operations Research(1):225~232
  • 2Marshall L. Fisher. A dual algorithm for the one-machine scheduling problem[J] 1976,Mathematical Programming(1):229~251
  • 3Ass. Prof. E. G. Coffman,Dr. R. L. Graham. Optimal scheduling for two-processor systems[J] 1972,Acta Informatica(3):200~213

共引文献19

同被引文献14

  • 1陈志龙,赵小平.两个可解的2×n自由作业排序问题[J].应用数学学报,1995,18(2):185-192. 被引量:2
  • 2韩继业 徐本顺.排序和时间表理论的进展.曲阜师范大学学报,1987,13(2):19-29.
  • 3Graham R L,Lawler E L,Lenstra J K,et al.Optimization and approximation in deterministic sequencing and scheduling:A survey[J].Ann.Discrete Math.,1979,5:287-326.
  • 4Gonzales T,Sahni S.Open shop scheduling to minimize finish time[J].J.Assoc.Comput.Mach.,1976,23:665-679.
  • 5Lawle E L,Labetoulle J.On preemptive scheduling of unrelated parallel processors by linear programming[J].J.Assoc.Comput.Mach.,1978,25:612-619.
  • 6Achugbue J O,Chin F Y.Scheduling the open shop to minimize mean flow time[J].SIAM J.Comput.,1982,11:709-720
  • 7Adiri I,Amit N.Open shop and flowshop scheduling to minimize sum of completion times[J].Comput.Ops.Res.,1984,11(3):275-284.
  • 8Dror M.Openshop scheduling with machine dependent processing times[J].Discrete Applied Mathematics,1992,39(3):197-205.
  • 9Vakharia A J,Catay B.Two machine open shop scheduling with machine dependent processing times[J].Discrete Applied Mathematics,1997,73(3):283-285.
  • 10Kleinau U.Tow-machine shop scheduling problems with batch processing[J].Math.Computer Modeling,1993,17(6):55-66.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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