报告人简介：

Teo Chung Piaw (张俊标）教授，1990年本科毕业于新加坡国立大学（NUS）数学系，1996年博士毕业于麻省理工学院（MIT）运作管理专业，博士毕业后即回到新加坡国立大学商学院任教至今，1996年至今担任新加坡国立大学商学院副教授/教授。目前，担任新加坡国立大学商学院决策科学系讲座教授，并且担任管理科学旗舰期刊Operations Research的领域主编（运作管理领域），Management Science的副主编。Teo Chung Piaw教授获得美国西北大学Eschbach 学者，台湾元智大学大学杰出访问教授等荣誉称号，担任2009年和2012年中国最高管理学奖-复旦“管理学杰出贡献奖”专家委员会委员、运筹学和管理学研究协会（INFORMS）的Nicholson论文竞赛委员会主席和IMPACT委员会委员、香港博士奖学金遴选委员会委员。在国际顶级期刊Operations Research, Management Science, Mathematical Programming， Mathematics of Operations Research等发表高水平论文60多篇，研究领域：服务和生产的灵活调度，离散优化，港口集装箱业务和医疗等领域。

 报告简介： 

In many supply chains, a fixed pool of resources are shared flexibly between different supply chain partners for multiple products with random demands. What is the best way to configure the capacity of the supply chain resources and to allocate the available capacity, to meet pre-determined performance targets? How do we configure the performance targets in the first place? Using recent advances in online optimization, we develop a new theory of supply chain resource allocation, and characterize the relationship between the capacity of the supply chain and the attainable performance targets. We explicitly characterize a randomized allocation mechanism to ensure that the performance targets are attainable.We use this new theory to provide a new perspective to the well-known phenomenon that “long chain is almost as good as the fully flexible network”, and on various other supply chain planning problems.