第18屆台灣作業研究學會年會暨學術研討會
The 18th Annual Meeting of the Operations Research Society of Taiwan (ORSTW 2022)

2022年12月9日(週五)

國立陽明交通大學

大會議程

ORSTW2022議程.pdf

下載議程表

專題演講資訊

  • Prof. Zhe George Zhang (Western Washington University, USA)

Biographical sketch:
Prof. George Zhang received a BSc degree in computer science and an M.A. in economics from Nankai University in China; an MBA from Schulich School of Business at York University; and a Ph.D in Operations Research from the University of Waterloo. He is a professor of Operations Research and Quantitative methods in the Department of Decision Sciences, College of Business and Economics at Western Washington University, Washington, USA. He is also an adjunct professor in Management Science at Simon Fraser University, British Columbia, Canada. He is the director of the Center Operations Research and Management Science (CORMS) – recently established at Western Washington University, which promotes the research collaboration between North America (US and Canada) and the Asian Pacific region. Prof. Zhang’s research interests include queueing theory and applications, stochastic dynamic programming, probability models in reliability, and supply chain management issues in manufacturing and service organizations. His publications have appeared in many well-known journals in operations research and applied probability, and his research has been cited widely (Google Scholar). His research monograph entitled Vacation Queueing Models – Theory and Applications was published in 2006 by Springer Science, and this is the first book that discusses both single and multiple server queueing systems with vacations. His new book entitled Fundamentals of Stochastic Models will be published in 2023 by Taylor & Francis. Professor Zhang is one of Editors-in-chief of Journal of the Operational Research Society (JORS). As one of the premier operation research (OR) journals, JORS is the first OR journal in the world. He is also one of the founding Editors-in-chief of Queueing Models and Service Management (QMSM) and a Senior Editor of Production and Operations Management (POM). He was an associate editor of INFOR, and is on the editorial board of several international journals.

URL: https://cbe.wwu.edu/corms/director

Speech title: JORS and OR Journal Development – History, Current State, and Future Projection


  • Prof. Kazuo Iwama (Kyoto University, Japan / National Tsing Hua University, Taiwan)

Biographical sketch:
Prof. Kazuo Iwama is Visiting Chair Professor of National Ting Hua University. Before he joined NTHU, he had been with RIMS, Kyoto University, School of Information Science, Kyoto University, Kyushu University, Charles University, UC Berkeley, and so on. He is a member of Academia Europae, the founder of Asian Association for Algorithms and Computation (AAAC), and Honorary Doctor, University of Latvia. He served as the Editor-in-Chief of Bulletin, European Association for Theoretical Computer Science (EATCS) for more than eight years. He organized SODA and ICALP, two topmost conferences in the field of algorithms and computation, both of which were first held in Asia. His main research interests include design and analysis of algorithms, computational complexity theory and quantum computation.

URL: https://ieem.site.nthu.edu.tw/p/406-1310-216921,r2658.php

Speech title: Stable Marriage and Stable Roommate Problems

Abstract:

There is an old, pretty well-known and still unsolved open question about the stable marriage problem, namely asking if there is a "close" relationship between the stable marriage and the stable roommate problems. Here, close means that any stable roommate instance can be reduced to a stable marriage instance having a one-to-one mapping between their stable matchings. If such a reduction exists, a variety of stable marriage algorithms, mostly simple and elegant, can be used to solve corresponding stable roommate problems that are generally much harder than the former. In this talk, after a long introduction of the stable marriage problem for those who are unfamiliar (or even first-timers) with this topic, observations from different angles are given on why the open problem is important, nontrivial and deep.

各場次論文發表須知

  • 各場次安排至多 6 篇論文,發表與討論時間共 90 分鐘。

  • 每一篇論文報告時間為 12 分鐘、Q&A 時間 3 分鐘

  • 請報告人自行攜帶 PowerPoint 檔案,提前10分鐘至所屬場次教室現場存入檔案。