基于贪心算法的板式家具订单备料调度研究  

Research on Material Preparation Scheduling for Panel Furniture Orders Based on Greedy Algorithm

作　　者：杨冰 魏新莉[1] 胡孙跃[2] 苏利江 杜辉 YANG Bing;WEI Xin-li;HU Sun-yue;SU Li-jiang;DU Hui(Central South University of Forestry and Technology,Changsha 410004,Hunan,P.R.China;Zhejiang Agriculture and Forestry University,Hangzhou 311300,Zhejiang,P.R.China)

机构地区：[1]中南林业科技大学,湖南长沙410004 [2]浙江农林大学,浙江杭州311300

出　　处：《林产工业》2024年第4期72-75,共4页China Forest Products Industry

基　　金：教育部产学合作项目(220900483052020);湖南省生物质基材料绿色低碳智造工程技术研究中心(2022TP203)。

摘　　要：针对板式家具订单备料调度过程中的调度混乱、设备使用效率低的问题,本文通过对板式家具备料进行现场调研,结合订单开料工艺特点,以最小完工时间为目标,构建数学模型,将贪心算法应用在板式家具订单的调度备料中。在此基础上,依据模型进行算法设计,并对算法进行仿真试验,通过对采集的数据进行分析,验证了算法的可行性,提高了家具的备料效率。与工厂现有的调度方式相比,采用本文的调度方案可节约时间700 s,生产效率提高18.89%,对于解决多机并行的订单备料调度具有指导意义。In order to solve the problems of scheduling chaos and low equipment efficiency,and improve the efficiency of furniture processing in the scheduling process of order preparation for panel furniture,in this paper,based on the on-site investigation of panel furniture material preparation,combined with the characteristics of the order material issuing process,and with the minimum completion time as the goal,a mathematical model was constructed.The greedy algorithm was applied to the order material issuing scheduling of panel furniture,and the algorithm was designed based on the model,and simulation experiments were conducted on the algorithm.The feasibility of the algorithm was verified by analyzing the collected data.Compared with the existing scheduling methods in factories,adopting this scheduling scheme can save 700 s of time and improve the production efficiency by 18.89%,which showed guiding significance for solving the problem of multi machine parallel order material preparation scheduling.

关 键 词：板式家具 备料调度 最小完工时间 贪心算法 多机并行 

分 类 号：TS664[轻工技术与工程] TS396