| 一个成组加工中加工时间可变的加工全程问题 |
| |
| 引用本文： | 程明宝,孙世杰. 一个成组加工中加工时间可变的加工全程问题[J]. 上海大学学报(自然科学版), 2003, 9(6): 533-536 |
| |
| 作者姓名： | 程明宝 孙世杰 |
| |
| 作者单位： | 上海大学,理学院,上海,200436;上海大学,理学院,上海,200436 |
| |
| 摘 要： | 该文考虑在成组加工中工件加工时间受位置影响的单机排序问题．目标函数为极小化加工全程．我们给出了此问题的最优性条件,并且构造了一个最优算法．
|
| 关 键 词： | 加工时间可变 加工全程 成组加工 算法 |
| 文章编号： | 1007-2861(2003)06-0533-04 |
| 修稿时间： | 2003-04-01 |
Makespan Problem in Group Processing with Controllable Processing Time |
| |
| CHENG Ming-bao,SUN Shi-jie. Makespan Problem in Group Processing with Controllable Processing Time[J]. Journal of Shanghai University(Natural Science), 2003, 9(6): 533-536 |
| |
| Authors: | CHENG Ming-bao SUN Shi-jie |
| |
| Abstract: | This paper considers a single machine scheduling problem in group processing with the processing time affected by their positions in a sequence. A minimized makespan is taken as an objective function. Optimal conditions are given and an optimal algorithm constructed. |
| |
| Keywords: | controllable processing-time makespan group processing algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
