Logistics Service Scheduling Model And Algorithm Under Mass Customization

Logistics service industry as an important part of service economy in China has attracted the attention of more and more enterprises and researchers.At present,in order to cope with increasingly complex personalized logistics services,considering the high logistics costs of personalized customization,many logistics enterprises begin to explore the mode of mass customization logistics service.Mass customization logistics service model,as the balance point between mass service model and personalized customization service model,can provide more personalized services,effectively reduce logistics costs,and improve customer satisfaction.However,on the one hand,the existing researches mainly focus on production and manufacturing and seldom involve systematic research on logistics service.On the other hand,most of the existing researches on logistics service focus on the influence of factors in the model on target cost,and Research on the ordering of service orders is relatively scarce.Therefore,this paper takes mass customization as the background,considers the relevant models and algorithms when the logistics service delivery window is a common delivery window and a slack delivery window,and makes an in-depth discussion and analysis of the results.The purpose of this thesis is to describe the research background,research significance,and related theories of logistics service scheduling in the context of mass customization,and to explore logistics service scheduling under mass customization and the no-wait flow shop model.Relevant references are summarized and categorized,the insufficiency in the research is pointed out through the compilation of literature reviews,and the research content of this thesis is proposed.This thesis considers the following two problems:(1)Based on logistics service scheduling model under the background of mass customization,we consider no-wait two-machine flow-shop scheduling with a common logistics service delivery time window.to minimize the total cost.We provide a polynomial time optimal algorithm inO(n~3)time.(2)On the basis of(1),we extend the common delivery time window to the slack delivery time window and also propose a polynomial time optimal algorithm.Finally,we use Java tools to analyze the algorithm designed in the two models mentioned above,and show the validity of the algorithm with data.