Parallel machine lot streaming scheduling problem based on improved VNDS algorithm
To solve parallel machine lot streaming problem with limited computing time,an improved Variable Neighborhood Decomposition Search(VNDS)algorithm based on order splitting strategies was proposed.By using the real-number coding,VNDS algorithm decomposed the codes into multiple small coding blocks with a fixed scale before each iteration,and there was a fixed size of codes were different between adjacent blocks.The neighborhood search of each coding block was carried out in turn by switch and insert neighborhoods in each iteration.The per-turbed neighborhood of VNDS was designed by cyclic transfer theory.To adapt to the characteristic that orders and sub-lots could be split,two splitting strategies were used to improve the VNDS algorithm.The orders and sub-lots were split between two adjacent iterations or after the iteration process ended,so as to optimize tardiness and makespan.Experimental results proved that the improved VNDS algorithm could obtain better solutions in a limited time by comparing with variable neighborhood search algorithm,simulated annealing algorithm and artificial bee colony algorithm.Applying the proposed algorithm to actual production of a cigarette factor could effectively improve the efficiency of production planning.
万方数据
维普
