【摘要】 针对工件加工时间为非对称模糊数,极小化提前完工惩罚和拖期完工惩罚之和的均值的单机工期指派调度优化问题(1|p|∑nM(e_iE_i+t_iT_i))展开研究.证明了当模糊加工时间具有相同宽度比时,该问题是多项式可解的,并给出了多项式求解算法.同时根据历史数据,构造了工期指派问题的调度模型,并利用所给出的算法求得最优解,从而表明所提出的模型和算法的有效性.更多还原

【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|∑nM(e_iE_i+t_iT_i)),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.更多还原