Optimally scheduling and loading tow trains of in-plant milk-run delivery for mixed-model assembly lines

摘要

Purpose - This paper aims to investigate the scheduling and loading problems of tow trains for mixed-model assembly lines (MMALs). An in-plant milk-run delivery model has been formulated to minimize total line-side inventory for all stations over the planning horizon by specifying the departure time, parts quantity of each delivery and the destination station. Design/methodology/approach - An immune clonal selection algorithm (ICSA) combined with neighborhood search (NS) and simulated annealing (SA) operators, which is called the NSICSA algorithm, is developed, possessing the global search ability of ICSA, the ability of SA for escaping local optimum and the deep search ability of NS to get better solutions. Findings - The modifications have overcome the deficiency of insufficient local search and deepened the search depth of the original metaheuristic. Meanwhile, good approximate solutions are obtained in small-, medium- and large-scale instances. Furthermore, inventory peaks are in control according to computational results, proving the effectiveness of the mathematical model. Research limitations/implications - This study works out only if there is no breakdown of tow trains. The current work contributes to the in-plant milk-run delivery scheduling for MMALs, and it can be modified to deal with similar part feeding problems. Originality/value - The capacity limit of line-side inventory for workstations as well as no stock-outs rules are taken into account, and the scheduling and loading problems are solved satisfactorily for the part distribution of MMALs.