期刊文献+

Flow shop排序问题F2|prmu|∑ω_jC_j的一个启发式算法

A heuristic algorithm for F2|prmu|∑ω_jC_j
下载PDF
导出
摘要 给出Flow shop排序问题F2|prmu|∑ωjCj的一个启发式算法,其最坏情况的界为2,且是 紧界.此外。 In this paper we presents a Heuristic algorithm for F2|prmu|∑ωjCj. The worst-case bound is 2, and this bound is tight. And, three polynomial solvable cases are discussed.
出处 《沈阳师范学院学报(自然科学版)》 CAS 2001年第4期8-13,共6页 Journal of Shenyang Normal University(Natural Science)
基金 辽宁省自然科学基金资助项目(99107001) 辽宁省教育厅科研基金资助项目(20262250)
关键词 排序 FLOWSHOP 启发式算法 NP-难问题 加权总完工时间 Scheduling Flow shop Heuristic algorithm NP - hardness Total weighted completion time
  • 相关文献

参考文献17

  • 1[1]J A Hoogeveen , T Kawaguchi. Minimizing Total Compltion Time In A Two-Machine Flow shop: Analysis of Special Cases[J]. Mathematics of Oper. Res. 1999,24:887-910.
  • 2[2]S M Johnson. Optimal two-and-three-stage production schedules[J]. Naval Res. Logist. Quart. 1954,1:61-68.
  • 3[3]Michael Pinedo. Scheduling-theory, algorithms and systems[M]. Pretice hall, Englewood cliffs, New jersey, 1995.
  • 4[4]H G Campbell, R A Dudek ,M L Smith. A Heuristic algorithm for the n Job m Machine sequencing problem[J].Management Sci.,1970,16:630-637.
  • 5[5]M Nawaz,E E enscore ,I Ham. A Heuristic algorithm for the m_machine, n_job Sequencing Problem[J].OMEGA., 1983.11:91-95.
  • 6[6]M wider ,A Hertz. A New Heuritic Method for the Flowshop Sequencing Problem[J].Eur.J.Oper.Res.,1989,11:186-193.
  • 7[7]G B Mcmahom ,P G Burton. Flow_shop scheduling with the Branch_and _Bound[J].Oper.Res.,1967,15:473-481.
  • 8[8]S Ashour. A Branch and Bound algorithm for the Flow_shop Scheduling problem[J].AIIE.Trans.,1970,2:172-176.
  • 9[9]K R Baker. Acomparative study of flow_shop algorithm[J].Oper.Res.,1975,23:62-73.
  • 10[10]B J Lageweg. J Klenstra, Rinnooy Kan A H G.A general bounding scheme for the permutation Flow_shop problem[J].Oper.Res.,1978.26:53-67.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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