Formulation and Complexity Analysis for 3PL Transportation Problems
Nowadays, it is popular to outsource transportation and distribution of finished products to third party logistics (3PL)provider in many industries. In order to shorten response time from order receipt to delivery, and also to improve on time delivery accuracy, manufacturing scheduling and transportation scheduling should be considered in a synchronization perspective. Thus, for the decision of 3PL transportation, production capacity is an important constraint. In this paper, 3PL transportation problems are classified. Formulation of each sub-problem is presented. Furthermore, computational complexity of each problem is proposed.
3PL Transportation Synchronization NP-completeness
Li Kunpeng
School of Management, Huazhong University of Science and Technology Wuhan, Hubei, 430074.P.R.China
国际会议
第六届管理学国际会议(Proceedings of ICM2007 the 6th International on Management)
武汉
英文
191-194
2007-08-03（万方平台首次上网日期，不代表论文的发表时间）