混合算法求解两阶段装配流水车间调度

Production planning and scheduling is the core problem of manufacturing companies, and tardiness and earliness may induce numerous problems, i.e. extra storage, prince changing, risk of damages, etc. For two-stage assembly flowshop scheduling problem, based on the JIT philosophy, we study the problem with setup times to achieve the optimum scheduling. In order to realize the goal of minimizing the sum of tardiness and earliness, a HGA-VNS (hybrid genetic algorithm-variable neighborhood search) is proposed. The optimum solution obtained by GA is utilized to the initial solution of VNS. With the help of the good local search ability of the VNS, the initial solution is improved. We use computational experiments and algorithm comparisons to demonstrate the effectiveness of HGA-VNS.