| 线性加工时间的树约束单机排序问题 |
| |
| 引用本文： | 许川容,谢政.线性加工时间的树约束单机排序问题[J].系统工程,2005,23(4):93-96. |
| |
| 作者姓名： | 许川容 谢政 |
| |
| 作者单位： | 国防科学技术大学,数学与系统科学系,湖南,长沙,410073 |
| |
| 摘 要： | 研究工件具有线性加工时间、工件间优先约束为树约束的单机排序问题。目标函数为极小化加权完工时间和。在工件加工时间是其开工时间的线性函数的条件下，本文证明了最大家庭树中的工件优先于家庭树中的其它工件的加工，并且其工件连续加工所得到的排序为最优排序。
|
| 关 键 词： | 排序 线性加工时间 树约束 最大家庭树 |
| 文章编号： | 1001-4098(2005)04-0093-04 |
Single Machine Scheduling with Tree-restricted and Linear Processing |
| |
| XU Chuan-rong,XIE Zheng.Single Machine Scheduling with Tree-restricted and Linear Processing[J].Systems Engineering,2005,23(4):93-96. |
| |
| Authors: | XU Chuan-rong XIE Zheng |
| |
| Abstract: | The single machine scheduling problem is considered with tree-structured and linear processing time ordering to minimize the total weighted completion time. In this case, jobs in the maximal family tree should be proceed prior to other jobs in family tree and the optimal schedule is obtained if their jobs aren't be preempted by the other jobs. |
| |
| Keywords: | Scheduling Linear Processing Time Tree-restricted The Maximal Family Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
