ENGLISH
您所在的位置: 首页» 新闻中心» 讲座预告

9-9 法国南特高等矿业学院/ International Journal of Production Research期刊主编Alexandre Dolgui教授学术讲座:Replenishment planning in supply chains under uncertainty of lead times

题目:Replenishment planning in supply chains under uncertainty of lead times
主讲人:Alexandre Dolgui教授(法国南特高等矿业学院/ International Journal of Production Research期刊主编)
时间:2015年9月9日上午10:30
地点:主楼418
主讲人简介:
     Alexandre Dolgui博士现为法国南特高等矿业学院教授、法国法约尔研究所主任、International Journal of Production Research期刊主编,长期从事供应链管理、制造系统设计与优化、运作管理等。Alexandre Dolgui教授曾担任IEEE Transactions on Industrial Informatics、International Journal of Systems Science、Omega和Computers & Industrial Engineering等多个主流期刊的副主编或区域编辑,担任多个主流国际会议主席或程序委员。其已在IIE Transactions、OMEGA、EJOR、IJPR和IJPE等国际主流SCI刊源上发表论文180余篇。
内容简介:
    Supply planning for the case of an assembly system with one type of finished product assembled from n different types of components is considered. The components are procured from n diverse external suppliers to satisfy finished product demand. It is supposed that the component lead times and the finished product demand are random discrete variables. The assembly company must determine what optimal quantities of components are and when is the right time to order? The objective is to minimize the total cost which is composed of holding component costs, tardiness penalties, lost sales and surplus item costs for finished products. A single-period analytical model is proposed. Several properties of the objective function are proven. They are used to develop a Branch and Bound algorithm. Numerical tests of the algorithm are presented. Five heuristics based on Newsvendor model for lead time and demand are proposed and compared with the Branch and Bound algorithm. These tests show that the suggested Branch and Bound algorithm can solve large size problems within a short time. The proposed heuristics but one are not competitive with the Branch and Bound algorithm. The truncated version of Branch and Bound give better results.


(承办:技术经济与战略管理、科研与学术交流中心)