題目：Replenishment planning in supply chains under uncertainty of lead times
主講人：Alexandre Dolgui教授（法國(guó)南特高等礦業(yè)學(xué)院/ International Journal of Production Research期刊主編）
時(shí)間：2015年9月9日上午10:30
地點(diǎn)：主樓418
主講人簡(jiǎn)介：
Alexandre Dolgui博士現(xiàn)為法國(guó)南特高等礦業(yè)學(xué)院教授、法國(guó)法約爾研究所主任、International Journal of Production Research期刊主編，長(zhǎng)期從事供應(yīng)鏈管理、制造系統(tǒng)設(shè)計(jì)與優(yōu)化、運(yùn)作管理等。Alexandre Dolgui教授曾擔(dān)任IEEE Transactions on Industrial Informatics、International Journal of Systems Science、Omega和Computers & Industrial Engineering等多個(gè)主流期刊的副主編或區(qū)域編輯，擔(dān)任多個(gè)主流國(guó)際會(huì)議主席或程序委員。其已在IIE Transactions、OMEGA、EJOR、IJPR和IJPE等國(guó)際主流SCI刊源上發(fā)表論文180余篇。
內(nèi)容簡(jiǎn)介：
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.
（承辦：技術(shù)經(jīng)濟(jì)與戰(zhàn)略管理、科研與學(xué)術(shù)交流中心）
