高级检索

    徐震浩, 周畅, 张凌波, 顾幸生. 柔性作业车间的成套订单调度问题[J]. 华东理工大学学报(自然科学版), 2020, 46(1): 58-67. DOI: 10.14135/j.cnki.1006-3080.20181109001
    引用本文: 徐震浩, 周畅, 张凌波, 顾幸生. 柔性作业车间的成套订单调度问题[J]. 华东理工大学学报(自然科学版), 2020, 46(1): 58-67. DOI: 10.14135/j.cnki.1006-3080.20181109001
    XU Zhenhao, ZHOU Chang, ZHANG Lingbo, GU Xingsheng. Whole-Set Orders Scheduling Problem in Flexible Job Shop[J]. Journal of East China University of Science and Technology, 2020, 46(1): 58-67. DOI: 10.14135/j.cnki.1006-3080.20181109001
    Citation: XU Zhenhao, ZHOU Chang, ZHANG Lingbo, GU Xingsheng. Whole-Set Orders Scheduling Problem in Flexible Job Shop[J]. Journal of East China University of Science and Technology, 2020, 46(1): 58-67. DOI: 10.14135/j.cnki.1006-3080.20181109001

    柔性作业车间的成套订单调度问题

    Whole-Set Orders Scheduling Problem in Flexible Job Shop

    • 摘要: 随着加工制造业的发展,面向成套订单的加工生产方式得到广泛的应用,但由于柔性作业车间的特殊性以及成套订单问题的复杂性,目前对该问题进行的相关研究极少。本文以最大化加权订单成套率为目标,提出了一种柔性作业车间环境下的成套订单调度模型;根据问题特点在最大最小蚂蚁系统(MMAS)的基础上加入了一种新的邻域结构,通过削减和消除订单及工件的交货时间瓶颈提高了加权订单成套率。采用正交试验方法对算法参数进行整定,与其他元启发式算法的对比结果验证了本文算法的先进性和稳定性。

       

      Abstract: With the technological development of manufacturing industry, the requirement of customer is moving toward diversity, small-scale, or even single-piece production. Customized production is mainly suitable for the aircraft and ship manufacturing industry. Conversely, the production method oriented to whole-set orders is having a more and more wide applications. However, up to now, there have been few related works on this issue of whole-set orders, due to the special nature of the flexible job shop and the complexity of the whole-set orders scheduling. To this end, this paper proposes a new scheduling model under flexible job shop environment so as to maximize the whole-set ratio of weighted orders. Meanwhile, the three distinctive characteristics are analyzed. In order to find the global optimal solution, a new neighborhood structure is proposed according to the characteristics of the whole-set orders scheduling model. A novel max-min ant algorithm with a neighborhood structure (MMAS-NS) is constructed based on the basic max-min ant system (MMAS), which can improve the objective by reducing and eliminating bottlenecks of delivery time for orders and workpieces. The influence of each parameter on the performance of algorithms is analyzed by orthogonal experiments, which also verifies the effectiveness of new neighborhood structure. Finally, the comparison with other novel meta-heuristic algorithms, e.g., imperialist competitive algorithm, is made, from which it is shown that the proposed MMAS-NS algorithm can effectively improve the whole-set ratio of weighted order.

       

    /

    返回文章
    返回