Dynamic scheduling problem with multi-spot producing
多点生产布局下的动态物流调度问题

This paper chose the pick-up process using vehicles under multi-spot producing after reorganization in tobacco industry as the subject, and constructed a mixed integer programming in order to set up the low-cost routes. Considering the characteristics of variables in the MIP, introduced the Benders decomposition method to solve the original problem. With the AMPL mathematical modeling language, implemented the modified algorithm, and investigated several numerical examples with three different parameters, compared with the Cplex solver, to verify its feasibility and effectiveness.