报告题目: Sequencing Surgeries for Operating Rooms Using Inventory Approximations
报告人（单位）：荣鹰（上海交通大学，安泰管理学院）
报告人（单位）：荣鹰（上海交通大学，安泰管理学院）
点评人（单位）：舒嘉（管理科学与工程系）；刘新旺（管理科学与工程系）
时间地点：2012年11月07日（周三）下午2点；九龙湖经管楼B204
Abstract:
The operating room (OR ) appointment planning process involves two sets of decisions: surgery sequencing; i.e., determining the order in which a list of surgeries should be performed in an OR; and appointment scheduling; i.e., planning starting times for the surgeries. These decisions are interconnected as their joint goal is to minimize the expected OR idle time and surgery late-start penalty costs incurred due to randomness in surgery durations. In this paper, we design new heuristics for sequencing surgeries. The idea behind the development of these heuristics is the structural connection between OR appointment scheduling and stochastic inventory control in serial supply chains. Observing this connection, we prove a duality relation between the two problems. Based on this duality result, we propose tractable approximations for the surgery sequencing problem, obtain several interesting insights, and further develop a very simple sequencing rule of ordering surgeries. Computational results show that our proposed heuristics produce close-to-optimal surgery sequences with significantly-shorter computation times compared to an exact mixed integer stochastic programming formulation based on the sample-average approach. More importantly, we demonstrate that these heuristics work well for the problem of assigning and sequencing surgeries in multiple ORs.
Bio:RONG, Ying is an assistant professor in the Department of Operations Management at Shanghai Jiao Tong University, Antai College of Economics and Management. He holds a B.E. in Telecommunication from Shanghai Jiao Tong University, and a Ph.D. in Industrial Engineering from Lehigh University, USA. He has published papers in leading journals such as Management Science, etc. His research interests include supply chain management, health care and energy.
The operating room (OR ) appointment planning process involves two sets of decisions: surgery sequencing; i.e., determining the order in which a list of surgeries should be performed in an OR; and appointment scheduling; i.e., planning starting times for the surgeries. These decisions are interconnected as their joint goal is to minimize the expected OR idle time and surgery late-start penalty costs incurred due to randomness in surgery durations. In this paper, we design new heuristics for sequencing surgeries. The idea behind the development of these heuristics is the structural connection between OR appointment scheduling and stochastic inventory control in serial supply chains. Observing this connection, we prove a duality relation between the two problems. Based on this duality result, we propose tractable approximations for the surgery sequencing problem, obtain several interesting insights, and further develop a very simple sequencing rule of ordering surgeries. Computational results show that our proposed heuristics produce close-to-optimal surgery sequences with significantly-shorter computation times compared to an exact mixed integer stochastic programming formulation based on the sample-average approach. More importantly, we demonstrate that these heuristics work well for the problem of assigning and sequencing surgeries in multiple ORs.
Bio:RONG, Ying is an assistant professor in the Department of Operations Management at Shanghai Jiao Tong University, Antai College of Economics and Management. He holds a B.E. in Telecommunication from Shanghai Jiao Tong University, and a Ph.D. in Industrial Engineering from Lehigh University, USA. He has published papers in leading journals such as Management Science, etc. His research interests include supply chain management, health care and energy.
报告题目: Supply Chain Finance under Bankruptcy Risks and Costs
报告人（单位）：赵文辉（上海交通大学，安泰管理学院）
点评人（单位）：舒嘉（管理科学与工程系）；刘新旺（管理科学与工程系）
时间地点：2012年11月07日（周三）下午3点；九龙湖经管楼B204
Abstract:
We consider a supply chain with a supplier and a retailer who has a single opportunity to order a product from the supplier to satisfy the future uncertain demand. Both the retailer and supplier are capital constrained and in need of short-term financing. We first study the supplier’s whole-sale price contract in the presence of the bankruptcy risks and costs of the retailer. The results indicate that for a “poor” retailer, his equilibrium ordering quantity will incur bankruptcy risks and is smaller than the unconstrained newsvendor because of the bankruptcy costs, and both the equilibrium ordering quantity and wholesale price increase in the retailer’s wealth. The results imply that the supply chain efficiency will be decreased due to the bankruptcy costs, and as a result, the supply chain coordination will becomes important for a poor supply chain, which we will briefly discuss as well.
Bio: Wenhui Zhao is an assistant professor of Operations Management at Antai College of Economics and Management, Shanghai Jiao Tong University. He received his PhD in Operations Research from The Ohio State University, USA. He has published papers in leading journals such as Operations Research, etc. His current research interests include supply chain finance, supply chain management, game theory, combinatorial optimization, and so on.