| 线性加工时间的成组排序问题 |
| |
| 引用本文： | 孙丽. 线性加工时间的成组排序问题[J]. 松辽学刊, 2008, 29(3): 141-143 |
| |
| 作者姓名： | 孙丽 |
| |
| 作者单位： | 兰州大学数学与统计学院,兰州730000 |
| |
| 摘 要： | 本文讨论了一类线性加工时间的成组排序问题，考虑了各工件的加工时间是其开工时间的线性增加函数，同组工件之间连续加工时没有安装时间，各组间工件连续加工时有与顺序无关的安装时间，同组工件必须连续加工．目标函数为极小化最大完工时间和总完工时间．基于对问题的分析，给出了多项式算法．
|
| 关 键 词： | 线性加工时间 成组排序 时间表长 总完工时间 |
Scheduling Problem with Linear Processing Times under Group Technology Assumption |
| |
| SUN Li. Scheduling Problem with Linear Processing Times under Group Technology Assumption[J]. Songliao Journal (Natural Science Edition), 2008, 29(3): 141-143 |
| |
| Authors: | SUN Li |
| |
| Affiliation: | SUN Li (College of Mathematics and Statistics, Lanzhou University, LanZhou 730000, China) |
| |
| Abstract: | This paper consider the scheduling problem with linear processing times under group technology assumption. In this paper,jobs processing time is a linear increasing function of its starting time.No setup time is required between jobs of the same group but there are sequence- independent group setup times between jobs from different groups.The objective is to minimize makespan. Based upon the analysis of the problem, the optimal algorithm is presented. |
| |
| Keywords: | linear processing times group schedule makespan total completion time |
| 本文献已被 维普 万方数据 等数据库收录！ |
