关键词: 定制家具, 出库打包问题, 柔性装配流水车间, 调度, 启发式算法

Abstract: To improve the overall efficiency of outbound and packing operations of the custom furniture automatic sorting system,according to the work characteristics of outbound and packing operations,outbound/packing problem could be considered as a three-stage flexible assembly flow shop scheduling problem with precedence constraints and machine constraints.Based on defining constraints and giving its mathematical description systematically,a mathematic model of three-stage flexible flow shop was formulated with the optimization objective of minimizing the weighted sum of outbound makespan,makespan in packing station and average waiting time of board in packing station.For the proposed model,a constructive heuristic algorithm H* was proposed.To validate the effectiveness of the algorithm,a set of examples were designed with the idea of split-plot experiment design to compared the performance of heuristic algorithm H* with the other seven dispatching rules and five meta-heuristic algorithms based on the literature.The results showed that the H* algorithm was effective in solving the proposed problem.

Key words: custom furniture, outbound/packing problem, flexible assembly flow shop, scheduling, heuristic algorithms