| 带有优先约束的分批排序问题 |
| |
| 引用本文： | 陈丽珍. 带有优先约束的分批排序问题[J]. 枣庄师专学报, 2009, 26(5): 64-67 |
| |
| 作者姓名： | 陈丽珍 |
| |
| 作者单位： | 山东农业大学,信息科学与工程学院,山东,泰安,271018 |
| |
| 摘 要： | 对工件带有优先约束的分批排序问题进行了研究，其目标函数为最大完工时间．优先约束为：有一个树上包含有n个工件，其余的m-1条链上的工件数总和为常数，且工件的加工时间不限制．对于此种情况，给出了一个多项式时间算法．
|
| 关 键 词： | 排序 批处理机 优先约束 算法复杂性 |
A Batching Schedule Problem with Chain Precedence Constraints |
| |
| CHEN Lizhen. A Batching Schedule Problem with Chain Precedence Constraints[J]. Journal of Zaozhuang Teachers' College, 2009, 26(5): 64-67 |
| |
| Authors: | CHEN Lizhen |
| |
| Affiliation: | CHEN Lizhen ( Shandong Agricultural University, College of Information Science and Engineerning, Tai an 271018,China) |
| |
| Abstract: | The problem of scheduling jobs with chain precedence constraints is considered. The target func- tion is minimizing the makespan. Precedence constraints are a tree, where n jobs in one tree, a constant number of jobs in the other m - 1 chains. And presents a polynomial algorithm for this case. |
| |
| Keywords: | schedule batching machine Precedence constraints the complexity of algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
