北京师范大学学报（自然科学版）2017，Vol.53Issue(5)：510-517,8.DOI:10.16360/j.cnki.jbnuns.2017.05.002
具有加工顺序约束和非对称模糊加工时间的工期指派调度方法
Assignment scheduling problem with precedence constraints and un-symmetrical fuzzy processing times
摘要
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.关键词
工期指派/模糊调度/可能性均值/优先加工顺序约束/近似算法Key words
due date assignment/fuzzy scheduling/possibilistic mean value/precedence constraint/approximate algorithm分类
数理科学引用本文复制引用
李金权,曾文艺..具有加工顺序约束和非对称模糊加工时间的工期指派调度方法[J].北京师范大学学报（自然科学版）,2017,53(5):510-517,8.基金项目
国家自然科学基金资助项目(11401030) （11401030）
广东省高等学校优秀青年教师培养计划资助项目(Yq2014228) （Yq2014228）
