期刊文献+

有调整时间的两机器流水作业总流程问题

MINIMIZING TOTAL COMPLETION TIME IN TWO-MACHINE FLOW PROCESS WITH SETUP TIME ADJUSTING
下载PDF
导出
摘要 在两机器流水作业问题中 ,每个工件在加工前有一调整时间 ,同一工件的调整是可以重叠的 ,但加工时间不能重叠 .本文以总流程为最优准则研究调整时间独立于加工时间的两机器流水作业问题 ,给出了问题最优解中工件排序应满足的条件 ;其次讨论当工件的两种时间满足一定条件时最优时间表的求法 ; For two-machine flow process problem, each job has a setup-time before it is processed, the setup step of the same job can be overlapped on two-machine, but the processing step can't. In this paper, the author give the conditions satisfied by sequence in solution of total completion problem for two-machine flow process problem with setup and processing time separated. When these two times satisfy some condition, the above problem can be solvable in polynomial time. Finally, some approximation algorithms are constructed.
出处 《佳木斯大学学报(自然科学版)》 CAS 2002年第4期369-372,共4页 Journal of Jiamusi University:Natural Science Edition
基金 江苏省教育厅自然科学基金资助项目 (0 1KJD110 0 0 5 )
关键词 调整时间 两机器流水作业 加工时间 总流程 近似算法 最优解 工件排序 flow process adjusting and processing time total flow approximation algorithms
  • 相关文献

参考文献5

  • 1D. R Sule, Sequencing n jobs on two machines with setup, processing and removal times separated[J]. Naval Research Logistics Quarterly, 29(1982) ,pp. 517-519.
  • 2D. R Sule, K.Y. Huang, Sequencing on two ani three machines with setup, processing and removal times separated [J].International Journal of Production Research, 21(1983), pp. 723-732.
  • 3M.R. Garey, D. S. Johson, R. Sethi, The complexity of flowshop and jobshopscheduling[J]. Mathematics ani Operations Research, 1(1976), pp. 117-129.
  • 4E. Ignall, L. Schrage, Application of the branch and bound technique to some flowshop scheduling problems[J]. Operations Research. 13(1965), pp. 400-412.
  • 5S. L Van de Velde, Minimizing total completion time in two-machine flowshop hy Lagrangian relaxation[J]. Annal Operation Reseach, 26(1990), pp. 257-268.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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