北京师范大学学报（自然科学版）2017，Vol.53Issue(2)：127-132,6.DOI:10.16360/j.cnki.jbnuns.2017.02.001
非对称模糊加工时间工期指派调度优化问题的一类多项式求解算法
A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time
摘要
Abstract
A single machine due date assignment scheduling problem with asymmetric fuzzy processing is investigated,to minimize the total earliness and tardiness penalties,written as 1 |～p | n∑-M(eiEi + tiTi).Further,it is proven to be polynomially solvable when the processing times have the same width ratio.A numerical example is shown to illustrate that the proposed method is effective based on the due date assignment scheduling problems with historical data of processing time.关键词
工期指派/模糊调度/模糊数/提前完工/拖期完工惩罚/可能性均值/可能性方差Key words
due date assignment/fuzzy scheduling/fuzzy number/earliness/tardiness penalty/possibility mean value/possibility variance分类
数理科学引用本文复制引用
李金权,曾文艺,王群智..非对称模糊加工时间工期指派调度优化问题的一类多项式求解算法[J].北京师范大学学报（自然科学版）,2017,53(2):127-132,6.基金项目
国家自然科学基金资助项目(11401030) （11401030）
广东省高等学校优秀青年教师培养计划资助项目(Yq2014228) （Yq2014228）
