|
|||||
|
|
| 带有链优先约束的分批排序 | |
| 引用本文： | 马冉,张玉忠,邹娟.带有链优先约束的分批排序[J].滨州学院学报,2007,23(6):26-29. |
| 作者姓名： | 马冉 张玉忠 邹娟 |
| 作者单位： | 1. 河南理工大学,数学与信息科学学院,河南,焦作,454000 2. 曲阜师范大学,运筹与管理学院,山东,日照,276826 3. 曲阜师范大学,数学学院,山东,日照,276826 |
| 基金项目： | 国家自然科学基金 , 山东省自然科学基金 |
| 摘 要： | 研究了工件有不同的到达时间和平行链约束(也就是每一个工件至多有一个前驱和一个后继)的情形.考虑有m条链,其中一条链上包含n个工件,其余的m-1条链上的工件数总和为常数,给出了一个多项式算法.同时指出,对于其他正则单目标函数也是多项式可解的. |
| 关 键 词： | 排序 分批排序 优先约束 |
| 文章编号： | 1673-2618（2007）06-0026-04 |
| 收稿时间： | 2006-10-11 |
| 修稿时间： | 2006年10月11 |
Batch-scheduling Jobs with Chain Precedence Constraints |
|
| MA Ran,ZHANG Yu-zhong,ZOU Juan.Batch-scheduling Jobs with Chain Precedence Constraints[J].Journal of Binzhou University,2007,23(6):26-29. | |
| Authors: | MA Ran ZHANG Yu-zhong ZOU Juan |
| Institution: | 1. College of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454000, China ; 2. College of Operations Research and Mana Qu fu Normal University ,Rizhao 2768 3. College of Mathematics, Qu f u Normal University gement Science, 26, China ; ,Rizhao 276826 ,China |
| Abstract: | The batch-scheduling problem where jobs with different release dates are under parallel chain-type(i.e.every job has at most one direct predecessor and at most one direct successor) is discussed in this article.A polynomial algorithm of minimizing the makespan for the case where one of m chains contains n jobs and the others contain a constant number of jobs is presented.In addition,we have shed light on the fact that for the other regular objective functions there exist polynomial algorithms for the same case. |
| Keywords: | scheduling batching scheduling precedence constraints |
| 本文献已被 维普 万方数据 等数据库收录！ | |