Abstract: Based on the research background of custom panel furniture industry,the scheduling problem with limited inbound buffer and packaging priority constraints was studied.The joint scheduling problem with limited inbound buffer and packaging priority was analyzed,and a mathematical model was constructed to optimize the maximum outbound completion time of the board and the minimum weighted sum of packaging completion time.A multi-stage heuristic algorithm S* was proposed to solve the problem based on the process analysis of the inbound and outbound packing phases.To further verify the effectiveness of the algorithm to solve this problem,a large number of comparative tests were designed.Meanwhile,the analysis of the test results showed that the quality and time consuming of S* were better than other algorithms under different level values of different influence factors.The research results would provide some theoretical support for improving the sorting efficiency of custom furniture automatic sorting system.Based on the research background of custom panel furniture industry,the scheduling problem with limited inbound buffer and packaging priority constraints was studied.The joint scheduling problem with limited inbound buffer and packaging priority was analyzed,and a mathematical model was constructed to optimize the maximum outbound completion time of the board and the minimum weighted sum of packaging completion time.A multi-stage heuristic algorithm S* was proposed to solve the problem based on the process analysis of the inbound and outbound packing phases.To further verify the effectiveness of the algorithm to solve this problem,a large number of comparative tests were designed.Meanwhile,the analysis of the test results showed that the quality and time consuming of S* were better than other algorithms under different level values of different influence factors.The research results would provide some theoretical support for improving the sorting efficiency of custom furniture automatic sorting system.

Key words: custom furniture, in and out scheduling, automatic sorting, heuristic algorithms

摘要： 本文以定制板式家具行业为研究背景,针对带有限入库缓冲区以及包装优先顺序约束的出入库调度问题展开研究。首先,通过对带有限入库缓冲区以及具有包装优先顺序约束的出入库联合调度问题进行分析,构建以板件最大出库完工时间和包装完工时间两者的加权和最小为优化目标的数学模型。其次,基于入库阶段和出库打包阶段的过程分析,提出了一种多阶段的启发式算法S*对问题进行求解。最后,为进一步验证算法求解该问题的有效性,设计了大量对比试验,同时通过对试验结果分析发现S*在不同影响因子的不同水平值下,求解的质量和耗时都优于其他算法。研究成果将为提升定制家具自动分拣系统的出入库分拣效率提供一定的理论支持。

关键词: 定制家具, 出入库调度, 自动分拣, 启发式算法