| 具有加工顺序约束和非对称模糊加工时间的工期指派调度方法 |
| |
| 引用本文： | 李金权,曾文艺.具有加工顺序约束和非对称模糊加工时间的工期指派调度方法[J].北京师范大学学报(自然科学版),2017,53(5):510-516. |
| |
| 作者姓名： | 李金权 曾文艺 |
| |
| 作者单位： | 北京师范大学珠海分校应用数学学院,519087,广东珠海;北京师范大学信息科学与技术学院,100875,北京 |
| |
| 基金项目： | 国家自然科学基金资助项目，广东省高等学校优秀青年教师培养计划资助项目 |
| |
| 摘 要： | 研究了工件加工时间是非对称模糊数、工件间具有优先加工顺序约束、目标函数为极小化提前完工惩罚和拖期完工惩罚和的均值的单机工期指派调度优化问题.证明了当模糊加工时间具有相同宽度比、优先加工约束关系为树状约束时,该问题是多项式可解的.进一步,当优先加工顺序为一般约束时,基于线性规划松弛技术,设计了近似比为2的近似算法.
|
| 关 键 词： | 工期指派 模糊调度 可能性均值 优先加工顺序约束 近似算法 |
Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times |
| |
| Institution: | 1)School of Applied Mathematics,Beijing Normal University,Zhuhai,519087,Zhuhai,Guangdong,China;
2)College of Information Science and Technology,Beijing Normal University,100875,Beijing,China |
| |
| Abstract: | A single machine due date assignment scheduling problem with asymmetric processing time and precedence constraints in fuzzy environment is investigated in the present work,to minimize total earliness and tardiness penalties.It is polynomially solvable with processing time at the same width ratio,and the precedence constraints are out-tree.Further,when the general constraints are involved,a 2-approximate algorithm is put forward based on linear relaxation method. |
| |
| Keywords: | due date assignment fuzzy scheduling possibilistic mean value precedence constraint approximate algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《北京师范大学学报(自然科学版)》下载免费的PDF全文 |
