Research On Coordinated Scheduling Of Production And Transportation In Distributed Multi-factory

The research on supply chain scheduling problem has been increasing in recent years.The supply chain management can make decisions which are beneficial to the overall situation and improve the overall competitiveness.The problem of production and transportation coordination scheduling is one of the important research directions of supply chain management,which consider the production and transportation activities into a unified scheduling decision-making system and arrange the production scheduling and transportation scheduling at the same time.The problem of distributed multi-factory production multi-vehicle transportation scheduling is common in real life.Many studies have simplified the problem in order to reduce the complexity.This paper will study the distributed multi-factory production and multi-vehicle transportation scheduling problem.The specific research contents are summarized as follows:1.This paper studies the distributed multi-factory production and transportation coordination scheduling problem considering factory inventory constraints and homogeneous vehicle size constraints.The job is processed by a single machine in factory.There are multiple homogeneous vehicles using the routing selection mode to transport completed jobs.Two vehicle return scenarios are considered,that is,the vehicle can only return to the original factory and the vehicle can return to any factory after transportation.The goal is to improve customer service levels,which can be expressed in two forms:minimizing the maximum delivery time of the job and minimizing the total delivery time of the job.The mathematical model of the problem is established and solved by genetic algorithm combined with the characteristics of the problem.This paper expounds the realization process of the algorithm.This includes coding methods,population initialization methods combined with vehicle capacity constraints,repair strategies,genetic operations and routing strategies,etc.An example is used to test the algorithm to finds the optimal strategy and optimal parameters of the algorithm.Under the optimal strategy and parameters of the algorithm,different examples of different problems are calculated to analyze the feasibility and stability of the algorithm.2.This paper studies the distributed multi-factory production and transportation coordination scheduling problem with factory inventory constraints and heterogeneous vehicle size constraints.The job is processed by a single machine in factory.There are multiple different types of vehicles using the routing selection mode to transport completed jobs.The vehicle capacity is different between different types of vehicles.The sum size of the job in the same batch is less than the vehicle’s capacity which transporting the job batch.Considering the case where the vehicle returns to the original factory and the vehicle returns to any factory.The goals are to minimize the maximum delivery time and minimize the total delivery time.The mathematical model of the problem is established and solved by genetic algorithm combined with the characteristics of the problem.This paper expounds the realization process of the algorithm.This includes population initialization methods and repair strategies combined with vehicle capacity constraints of the vehicle which transport the job batch.An example is used to test the algorithm to finds the optimal strategy and optimal parameters of the algorithm.Under the optimal strategy and parameters of the algorithm,different examples of different problems are calculated to analyze the feasibility and stability of the algorithm.