|
|||||
|
|
| 加工时间恶化的两个成组加工排序问题 | |
| 引用本文： | ChengMingbao SunShijie. 加工时间恶化的两个成组加工排序问题[J]. 高校应用数学学报(英文版), 2005, 20(2): 225-234. DOI: 10.1007/s11766-005-0055-z |
| 作者姓名： | ChengMingbao SunShijie |
| 作者单位： | Dept.ofMath.,ShanghaiUniv.,Shanghai200436,China |
| 摘 要： | This paper considers single-machine scheduling problems in group technology with the jobs‘ processing times being simple linear functions of their start times. The objective functions are the minimizing of makespan and total weighted completion time. Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved. |
| 关 键 词： | 排序问题 群论 工艺处理 时间约束 目标函数 |
| 收稿时间： | 2004-06-21 |
Two scheduling problems in group technology with deteriorating jobs |
|
| Cheng Mingbao,Sun Shijie. Two scheduling problems in group technology with deteriorating jobs[J]. Applied Mathematics A Journal of Chinese Universities, 2005, 20(2): 225-234. DOI: 10.1007/s11766-005-0055-z | |
| Authors: | Cheng Mingbao Sun Shijie |
| Affiliation: | Dept.of Math., Shanghai Univ., Shanghai 200436, China.;Dept.of Math., Shanghai Univ., Shanghai 200436, China. |
| Abstract: | This paper considers single-machine scheduling problems in group technology with the jobs' processing times being simple linear functions of their start times.The objective functions are the ~minimizing of makespan and total weighted completion time.Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved. |
| Keywords: | scheduling deteriorating jobs group technology algorithms. |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |