| 一类两机器 no-wait 流水作业总完工时间问题 |
| |
| 引用本文： | 皇甫荣,陈秀宏.一类两机器 no-wait 流水作业总完工时间问题[J].淮阴师范学院学报(自然科学版),2002,1(3):1-5. |
| |
| 作者姓名： | 皇甫荣 陈秀宏 |
| |
| 作者单位： | 1. 淮阴师范学院,楚州校区,江苏,楚州,223200
2. 淮阴师范学院,数学系,江苏,淮安,223001 |
| |
| 基金项目： | 江苏省教育厅自然科学基金资助项目(0 0KJD110 0 0 1) |
| |
| 摘 要： | 在两机器 no-wait 流水作业问题中,每个工件在加工前有一调整时间,加工完之后有一移走时间,同一工件的调整和移走是可以重叠的,但加工时间不能重叠,同时任一工件在第二台机器上的加工必须紧接在它在第一台机器上的加工之后进行,本文以总完工时间为目标函数,讨论问题最优解中工件排列应满足的条件;其次讨论当工件的三种时间满足一定条件时最优时间表的求法;最后为问题设计了一个近似算法.
|
| 关 键 词： | no-wait流水作业 调整与移走时间 加工时间 总完工时间 近似算法 |
| 文章编号： | 1671-6876(2002)03-0001-05 |
| 修稿时间： | 2002年4月28日 |
Minimizing the Total Time Consumption of a Pipelining Task between Two Machines |
| |
| Minimizing the Total Time Consumption of a Pipelining Task between Two Machines.Minimizing the Total Time Consumption of a Pipelining Task between Two Machines[J].Journal of Huaiyin Teachers College(Natrual Science Edition),2002,1(3):1-5. |
| |
| Authors: | Minimizing the Total Time Consumption of a Pipelining Task between Two Machines |
| |
| Abstract: | When two machines are involved in a pipelining task, there is an interval to adjust every workpiece before it is processed and another interval to remove it after processing. The two intervals can be overlapped but the interval of processing cannot. A workpiece must be processed on one machine before its processing on the other one. This article first discusses the conditions that must be satisfied for an optimal sequence of workpieces, with the total time as the object function; then it talks about how to find an optimal time table when the three intervals concerning a workpiece meet some conditions; and finally it ends up with an approximation algorithms. |
| |
| Keywords: | no wait flowshop setup removal and processing time total completion time solvable cases approximate algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
