Font Size: a A A

A Study On Synchronized 3PL Transportation Scheduling Problem Of MTO Supply Chain

Posted on:2012-11-23Degree:MasterType:Thesis
Country:ChinaCandidate:Y XuFull Text:PDF
GTID:2219330362957917Subject:Logistics Engineering
Abstract/Summary:PDF Full Text Request
As market competition aggravated, products renewal speed up and products diversification increase. Customers are more likely to pursue personalized requirements. Manufacturers must offer customized productions. Especially for electronic products, FMCG, etc. MTO mode of production gradually become the mainstream market pattern. Under MTO production mode, Customer's demand is very sensitive to time, effective response becomes an important factor that affect supply chain requirements. To maximize profit, manufacturers must balance between time and costs. 3PL fully mobilize social resources, they provide customers fully functional logistics service and efficiency distribution with lower cost. 3PL has become the trend of modern logistics. More and more manufacturers outsource logistics and distribution to 3PL.This paper study on MTO supply chain, and manufacturers outsource logistics to 3PL. 3PL enterprise's transportation dispatching decision depands on 3PL rather than manufacturers. 3PL given transport departure time, arrival time, available capacity and transportation cost. According to its production scheduling and order distribution requirements, manufacturers choose the right 3PL service, so that to satisfy JIT distribution with a minimum cost. This thesis introduces a model on this background, and designs an optimal algorithm for the model. The optimal algorithm based on branch and bound, first to get optimal lower bound by Lagrangian Relaxation. For small scale problems, get optimal solution by the optimized software (lingo7.0) , and verification the lower bound quality. For large scale problems, get lower bound by linear relaxation, and verification the lower bound quality get by lagrangian relaxation. As the solution get by lagrangian relaxation is infeasible, this paper design a heuristic based on lagrangian relaxation to get feasible results, and this results is the upper bound of the problem. Then, use branch and bound to acquire the accurate results.
Keywords/Search Tags:MTO Supply Chain, 3PL, Transportation Scheduling, Lagrangian Relaxation, Branch and Bound
PDF Full Text Request
Related items