题目：Polynomial Algorithms in Scheduling and Networks
主讲人：Mohamed I. Dessouky, Research Professor, University of Southern California, USA
时间：2016年11月3日（周四）, 10: 00 - 11:30
地点：新主楼A209
摘要：
This presentation aims to illustrate the value of polynomial (greedy) algorithms to find optimal or near-optimal solutions to special problems in scheduling and network analysis. After noting the role and advantages of greedy algorithms we review the direction of scheduling research we present applications to deterministic and stochastic parallel machine scheduling problems. We also discuss bi-criteria shortest path problems in networks and the application of polynomial algorithms in enumeration efficient paths in some of them.
报告人简介：
Dr. Mohamed Dessouky received his B.Sc. in Mechanical Engineering from
Cairo University
,
Egypt
. He obtained his M.S. in Industrial Engineering at
Purdue
University
and his Ph.D. in the same field at The Ohio State University. Dr. Dessouky was on the faculty of
University
of
Illinois
at Urbana-Champaign for 22 years, and then joined
Northern
Illinois
University
as Chair, Department of Industrial Engineering. Currently, he is Research Professor, Daniel J. Epstein Department of Industrial and Systems Engineering,
University
of
Southern California
. He has been serving as Editor-in-Chief of Computers & Industrial Engineering: An International Journal, since 1998. He has consulted for many companies and organizations including Western Electric, Kalkan Foods, Andrew Corporation, and the United Nations Industrial Development. Organization (
Vienna
,
Austria
). He also provided advice to many small industries. He has given seminars and/or engaged in consulting projects in several countries, including
Egypt
,
Sudan
,
Brazil
,
Turkey
,
Kuwait
,
Indonesia
,
Japan
, and
China
. His research interests are in scheduling, network analysis, and project management. He published many refereed articles in these areas. His current focus is on bicriteria optimization of shortest paths in networks.
经管学院科研办
2016-10-31
