Branch And Bound Algorithm For Renewable Scheduling Problem

Automotive manufacturing utilizes special containers for the partsinbound logistics. The containers plays an important role during thetransportation process. The lacking of containers will lead to inefficient useof vehicle and increase waiting time. This thesis analyzes the multi-vehiclescheduling problem under limited special containers. The goal is to minimizethe makespan.First a mathematical model describing the problem is given. Then amixed-integer linear programming model is formed. Based on the model, thebranch and bound algorithm is developed to obtain optimal solutions. Further,this paper also developed a rolling branch and bound algorithm.Numerical experiments are given to verify the effectiveness of proposedalgorithm. The results indicate that the model and algorithm given in thisthesis can effectively solve this kind of scheduling problem.The model and algorithm proposed in this thesis have strong theoreticalvalues, which may be used as a guidance towards a third-party logisticscompany for designing and scheduling the distribution system.