报告题目：Graph Algorithms and Applications in Supply Chains
报 告 人：Eugene Levner教授
所在单位：School of Economics in Ashkelon Academic College, Ashkelon, Israel
内容概述：In the introductory part of the talk, examples of graph models successfully used in SC management will be briefly overviewed (the shortest path problem, TSP, CPM, etc.) The main part of the talk is devoted to the analysis of a multi-echelon supply chain consisting of suppliers, warehouses, customers and transportation facilities. The objective is to minimize the total inventory and transportation costs. A graph model and a network flow algorithm are described. The Wagner–Whitin property, known for the lot-sizing problem, is extended to the case of backorders and outsourcing. Open questions and directions for future research will be discussed.
主 持 人：车阿大教授
报告人简介：Eugene Levner received the B.S. +M.S. degree in computational mathematics from Lomonosov State University, Moscow, USSR, and the Ph.D. degree in computer & systems sciences from the Soviet Academy of Sciences, Moscow, in 1968 and 1973, respectively. From 1972 to 1990, he worked for the Soviet Academy of Sciences, Moscow, Russia. From 1994 to 2010 he worked in Holon Institute of Technology, Holon, Israel. In 2010 he joined School of Economics in Ashkelon Academic College, Ashkelon, Israel, where he is currently a Full Professor with tenure.
His research interests include combinatorial optimization, operations research, design of computer algorithms, and scheduling theory. He has authored/coauthored seven books and more than 150 papers in refereed journals and chapters in books. He is a recipient of Best Paper Awards from the Soviet Academy of Sciences and the IFAC INCOM-2009 National Committee in 1972 and 2009, respectively.
He is Associate Editor of IEEE Transactions on Industrial Informatics, Journal of Industrial Management and Optimization, and Journal of Service Science and Management, and a member of the editorial boards of other international journals.