| 树约束线性加工时间的单机排序问题 |
| |
| 引用本文： | 许川容,谢政,张洁.树约束线性加工时间的单机排序问题[J].系统管理学报,2006,15(5):471-474. |
| |
| 作者姓名： | 许川容 谢政 张洁 |
| |
| 作者单位： | 1. 重庆后勤工程学院,基础部,重庆,400042
2. 国防科技大学,数学与系统科学系,长沙,410073 |
| |
| 摘 要： | 讨论工件具有线性加工时间,工件间优先约束为树约束的单机排序问题。当目标函数为极小化加权完工时间和时,问题比相应的经典排序问题复杂,在工件间优先约束为出、入树2种情况下,分别给出了该问题最优排序的多项式算法。
|
| 关 键 词： | 排序 线性加工时间 树约束 加权完工时间和 |
| 文章编号： | 1005-2542(2006)05-0471-04 |
| 修稿时间： | 2005年10月17 |
Single Machine Scheduling Problem with Tree-Structured and Linear Processing Times |
| |
| XU Chuan-rong,XIE Zheng,ZHANG Jie.Single Machine Scheduling Problem with Tree-Structured and Linear Processing Times[J].Systems Engineering Theory·Methodology·Applications,2006,15(5):471-474. |
| |
| Authors: | XU Chuan-rong XIE Zheng ZHANG Jie |
| |
| Abstract: | The single machine scheduling problem is discussed with tree-structured and linear processing time.Although these problems are more complicated than the classical ones when the objective is to minimize the total weighted completion time.The optimal algorithms are given respectively in the case of the precedence being outtree and intree. |
| |
| Keywords: | scheduling linear processing time tree-structured the total weighted completion time |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
