| 加工时间依赖工件位置的链约束单机排序问题 |
| |
| 引用本文： | 赵晓丽.加工时间依赖工件位置的链约束单机排序问题[J].哈尔滨商业大学学报(自然科学版),2008,24(5):596-599. |
| |
| 作者姓名： | 赵晓丽 |
| |
| 作者单位： | 哈尔滨商业大学基础科学学院,哈尔滨,150028 |
| |
| 摘 要： | 讨论了工件加工时间依赖工件位置的链约束单机排序问题．对于链可中断和不可中断两种情形．证明了目标函数为最大完工时间和总完工时间时该问题仍然多项式时间可解．
|
| 关 键 词： | 排序 单机 学习效应 链约束 最大完工时间 |
Single machine scheduling with chains constraints and position-dependent processing times |
| |
| ZHAO Xiao-li.Single machine scheduling with chains constraints and position-dependent processing times[J].Journal of Harbin University of Commerce :Natural Sciences Edition,2008,24(5):596-599. |
| |
| Authors: | ZHAO Xiao-li |
| |
| Affiliation: | ZHAO Xiao-li (School of Basic Science,Harbin University of Commerce,Harbin 150028,China) |
| |
| Abstract: | In this paper,a single machine scheduling problem in which the job subjects to chains constrains and the job processing times are defined by functions dependent on their positions in the sequence.Under non-preemptive chains and preemptive chains,it is proved that makespan and total completion time problems remain polynomially solvable |
| |
| Keywords: | scheduling single machine learning effect chains constraints total completion time |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
