| 有调整时间的两机器流水作业总流程问题 |
| |
| 引用本文： | 顾成扬,陈秀宏.有调整时间的两机器流水作业总流程问题[J].佳木斯大学学报,2002,20(4):369-372. |
| |
| 作者姓名： | 顾成扬 陈秀宏 |
| |
| 作者单位： | 淮阴师范学院数学系 江苏淮安223001
(顾成扬)，淮阴师范学院数学系 江苏淮安223001(陈秀宏) |
| |
| 基金项目： | 江苏省教育厅自然科学基金资助项目 (0 1KJD110 0 0 5 ) |
| |
| 摘 要： | 在两机器流水作业问题中 ,每个工件在加工前有一调整时间 ,同一工件的调整是可以重叠的 ,但加工时间不能重叠 .本文以总流程为最优准则研究调整时间独立于加工时间的两机器流水作业问题 ,给出了问题最优解中工件排序应满足的条件 ;其次讨论当工件的两种时间满足一定条件时最优时间表的求法 ;最后给出几个近似算法
|
| 关 键 词： | 流水作业 调整与加工时间 总流程 近似算法 |
| 文章编号： | 1008-1402(2002)04-0369-04 |
| 修稿时间： | 2002年9月25日 |
MINIMIZING TOTAL COMPLETION TIME IN TWO-MACHINE FLOW PROCESS WITH SETUP TIME ADJUSTING |
| |
| GU Cheng-yang,CHEN Xiu-hong.MINIMIZING TOTAL COMPLETION TIME IN TWO-MACHINE FLOW PROCESS WITH SETUP TIME ADJUSTING[J].Journal of Jiamusi University(Natural Science Edition),2002,20(4):369-372. |
| |
| Authors: | GU Cheng-yang CHEN Xiu-hong |
| |
| Abstract: | 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. |
| |
| Keywords: | flow process adjusting and processing time total flow approximation algorithms |
| 本文献已被 CNKI 维普 等数据库收录！ |
