基于后悔值准则的个性化产品鲁棒调度

发布时间：2018-05-28 02:40

本文选题：变速平行机 + 不确定加工时间　；参考：《工业工程与管理》2017年05期

【摘要】：个性化产品的生产过程具有非重复性,致使工序的加工时间不确定且难以估计其概率信息。因此,传统的确定调度和随机调度方法不再适用。采用最小化最大后悔值的鲁棒优化方法,研究变速平行机加工环境下个性化产品的生产调度问题。首先,采用区间情景描述不确定的加工时间,构建基于后悔值准则的个性化产品鲁棒调度模型;其次,证明任意调度方案带来的最大后悔值可通过求解一个指派问题得到;然后,提出基于混合整数规划和迭代松弛过程的两种精确算法获取最优解;最后,通过仿真实验评估两种精确算法的有效性,结果表明基于混合整数规划的精确算法明显优于迭代松弛算法,并且可以快速求解中小规模的调度问题。
[Abstract]:The production process of individualized products is non-repeatable, which makes the processing time uncertain and the probability information difficult to estimate. Therefore, the traditional deterministic scheduling and stochastic scheduling methods are no longer applicable. Based on the robust optimization method of minimizing the maximum regret value, the production scheduling problem of personalized products in variable speed parallel machining environment is studied. Firstly, the uncertain processing time is described by interval scenario, and the robust scheduling model of personalized product based on regret value criterion is constructed. Secondly, it is proved that the maximum regret value brought by arbitrary scheduling scheme can be obtained by solving an assignment problem. Then, two exact algorithms based on mixed integer programming and iterative relaxation process are proposed to obtain the optimal solution. Finally, the effectiveness of the two exact algorithms is evaluated by simulation experiments. The results show that the exact algorithm based on mixed integer programming is superior to the iterative relaxation algorithm and can be used to solve small and medium scale scheduling problems.
【作者单位】：长安大学经济与管理学院;西安交通大学管理学院;西安电子科技大学经济与管理学院;
【基金】：国家自然科学基金资助项目(71502132,71403031,71371149) 陕西省自然科学基础研究计划资助项目(2015JQ7274) 中央高校基本科研业务费专项资金资助项目(310823153014,31082315100,310823160101)
【分类号】：F273

【相似文献】