BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IORA - Institute of Operations Research and Analytics - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://iora.nus.edu.sg
X-WR-CALDESC:Events for IORA - Institute of Operations Research and Analytics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:+08
DTSTART:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20260520T100000
DTEND;TZID=Asia/Singapore:20260520T113000
DTSTAMP:20260602T214058
CREATED:20260513T081843Z
LAST-MODIFIED:20260513T081843Z
UID:27602-1779271200-1779276600@iora.nus.edu.sg
SUMMARY:DAO-ISEM-IORA Seminar Series: Diwakar Gupta
DESCRIPTION:Name of Speaker\n\n\nDiwakar Gupta \n\n\n\n\nSchedule \n\n\n20 May 2026\, 10am – 11.30am \n (60 min talk + 30 min Q&A)\n\n\n\nVenue \n\n\nBIZ1-0302\n\n\n\nLink to register \n(via Zoom)\n\nhttps://nus-sg.zoom.us/meeting/register/Wne_hIgXQ-qf4uJZ1Frn5Q\n\n\n\n\nTitle\n\n\nThe Impact of List Diving on Post-Transplant Outcomes\n\n\n\n\nAbstract \n\nTransplant programs often turn down deceased-donor kidney offers for their top-ranked potential transplant recipients (PTRs) and utilize them for lower-ranked PTRs. This practice is known as list diving. PTRs in the US are ranked based on an evidence- and consensus-based policy that reflects the collective judgment of stakeholders in the kidney transplant ecosystem. Because list diving upends the consensus ranking\, concerns have been raised about its impact on the national system. In this talk\, I will present an empirical analysis of the Organ Procurement and Transplantation Network (OPTN) data to quantify the impact of list diving decisions on short- and long-term survival of PTRs after accounting for the endogeneity of such decisions. I will also illustrate the impact of list diving on skipped candidates. The analysis shows that list diving worsens 1 and 3-year survival for transplants performed by centers with significant within-DSA competition. A significant minority of first-ranked skipped candidates do not receive transplants and either die or are removed from waitlist. Their average wait time is 8 months longer. The study highlights the need for greater oversight over transplant programs’ utilization decisions.\n\n\n\nAbout the Speaker\n\n\nDiwakar Gupta holds an appointment as the INBA–Stuart Centennial Professor of Information\, Risk\, and Operations Management at the McCombs School of Business of The University of Texas at Austin. His research spans healthcare operations\, supply chain finance and risk management\, and inventory and revenue management. He serves as the departmental editor of healthcare operations department at the Naval Research Logistics journal and as senior editor of healthcare operations management department at the POMS journal. He teaches healthcare analytics at UT Austin.
URL:https://iora.nus.edu.sg/events/dao-isem-iora-seminar-series-diwakar-gupta/
CATEGORIES:IORA Seminar Series
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20260522T100000
DTEND;TZID=Asia/Singapore:20260522T113000
DTSTAMP:20260602T214058
CREATED:20260518T033949Z
LAST-MODIFIED:20260518T033949Z
UID:27604-1779444000-1779449400@iora.nus.edu.sg
SUMMARY:DAO-ISEM-IORA Seminar Series: George Shanthikumar
DESCRIPTION:Name of Speaker\n\n\nGeorge Shanthikumar \n\n\n\n\nSchedule \n\n\n22 May 2026\, 10am – 11.30am \n (60 min talk + 30 min Q&A)\n\n\n\nVenue \n\n\nBIZ1-0302\n\n\n\nLink to register \n(via Zoom)\n\nhttps://nus-sg.zoom.us/meeting/register/nhLjyspHTpuCwf5OfrR7rg\n\n\n\n\nTitle\n\n\nFull Space (FS) Relative Valuations\, Risk Measures and Valuations of Risky Prospects\n\n\n\n\nAbstract \n\n\nThis paper proposes a unified mathematical infrastructure for the valuation of risky prospects:the Full-Space (FS) Relative Valuation framework. This framework generalizes and synthesizes disparate valuation paradigms in economics\, finance\, and insurance into a single\, coherent structure. We demonstrate that the FS framework is both general and tractable. Its core representation is characterized by necessary and sufficient conditions (i.e.\, modularity on the lattice of quantile or distribution functions) and we show it can be generalized to represent any valuation functional as an infimum over FS-type kernels. The framework also possesses desirable theoretical properties (e.g.\, monotonicity\, concave order preservation) and admits practical representations\, including certainty-equivalent construction and a computationally appealing Fenchel-type supremum form. By integrating these features\, FS valuations offer a powerful and versatile foundation for modeling and optimization across disciplines. \n\n\n\n\nAbout the Speaker\n\n\nProfessor Shanthikumar joined the Krannert faculty in 2009. Prior to coming to Purdue\, he was a Chancellor’s Professor of Industrial Engineering and Operations Research at the University of California\, Berkeley. His research interests are in integrated interdisciplinary decision making\, model uncertainty and learning\, production systems modeling and analysis\, queueing theory\, reliability\, scheduling\, semiconductor yield management\, simulation stochastic processes\, and sustainable supply chain management. He has written or co-written more than 250 papers on these topics. He is a co-author (with John A. Buzacott) of the book Stochastic Models of Manufacturing Systems and a co-author (with Moshe Shaked) of the books Stochastic Orders and Their Applications and Stochastic Orders. \nHe was a co-editor of Flexible Services & Manufacturing Journal and is (or was) a member of the editorial boards of the Asia-Pacific Journal of Operations Research\, IEEE Transactions on Automation Sciences and Engineering\, IIE Transactions\, International Journal of Flexible Management Systems\, Journal of Discrete Event Dynamic Systems\, Journal of the Production and Operations Management Society\, Operations Research\, Operations Research Letters\, OPSEARCH\, Probability in the Engineering and Information Sciences\, and Queueing Systems: Theory and Applications.\nProfessor Shanthikumar has extensively consulted for various companies\, including Applied Materials (AMAT)\, Bellcore\, IBM\, KLA-Tencor\, NTT (Japan)\, Intel\, Intermolecular\, ReelSolar\, Safeway\, and Southern Pacific. Through KLA-Tencor\, he has worked on joint development projects for Advanced Micro Devices\, IBM\, Intel\, LSI\, Motorola\, Texas Instruments\, Toshiba\, Fujitsu\, Taiwan Semiconductor Manufacturing Company\, and UMC.
URL:https://iora.nus.edu.sg/events/dao-isem-iora-seminar-series-george-shanthikumar/
CATEGORIES:IORA Seminar Series
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20260604T100000
DTEND;TZID=Asia/Singapore:20260604T113000
DTSTAMP:20260602T214058
CREATED:20260602T031622Z
LAST-MODIFIED:20260602T031622Z
UID:27613-1780567200-1780572600@iora.nus.edu.sg
SUMMARY:DAO-ISEM-IORA Seminar Series: Jiheng Zhang
DESCRIPTION:Name of Speaker\n\n\nJiheng Zhang \n\n\n\n\nSchedule \n\n\n4 Jun 2026\, 10am – 11.30am \n (60 min talk + 30 min Q&A)\n\n\n\nVenue \n\n\nBIZ1-0302\n\n\n\nLink to register \n(via Zoom)\n\nhttps://nus-sg.zoom.us/meeting/register/wv9WK1alQ6SrTblAvPtglw\n\n\n\n\nTitle\n\n\nAI for OR and OR for AI\n\n\n\n\nAbstract \n\n\n\nThis talk explores the interplay between Operations Research (OR) and Large Language Models (LLMs) through two complementary research directions. \n\n\nIn the first part\, we study the scheduling of LLM inference workloads across large GPU clusters. LLM inference involves two phases: a compute-intensive prefill phase that processes user input\, and a memory-bound decode phase that generates output tokens. When these phases share GPU resources\, prefill tasks throttle concurrent decodes\, creating state-dependent contention that is further complicated by workload heterogeneity across applications. We formulate this as a multiclass many-server queueing network with state-dependent service rates\, grounded in empirical iteration-time measurements. We analyze the fluid approximation and solve steady-state linear programs that characterize optimal resource allocation. We design gate-and-route policies that regulate prefill admission and decode routing\, and prove their asymptotic optimality in the many-GPU limit. We further extend the framework to incorporate service level indicators such as latency and fairness. Numerical experiments demonstrate that our policies outperform standard serving heuristics. \n\n\nIn the second part\, we consider the reverse direction: using LLMs to automate OR analysis. Formulating optimization models from natural language and generating executable solver code could reduce reliance on scarce expert knowledge\, but LLMs suffer from probabilistic inconsistency and existing methods face a data efficiency dilemma. We propose OR-R1\, a framework that integrates supervised fine-tuning with Test-Time Group Relative Policy Optimization (TGRPO). TGRPO extracts reliable training signals from unlabeled data by generating multiple candidate solutions and treating the solver-verified consensus as the ground truth. We provide theoretical guarantees for gradient convergence and show that this voting-based proxy consistently maximizes true solution accuracy. OR-R1 requires only 10% of the training data used by prior methods\, yet achieves state-of-the-art accuracy across eight OR benchmarks. \n\n\n\n\n\nAbout the Speaker\n\n\nJiheng Zhang is a Professor in the Department of Industrial Engineering and Decision Analytics at HKUST\, where he also holds a joint appointment in the Department of Mathematics. His research interests include stochastic modeling and optimization\, statistical learning\, numerical methods\, and algorithms\, with applications in operations management\, large communication networks\, and financial technology. He serves as an associate editor for several top journals\, including Operations Research\, Stochastic Systems\, and Probability in the Engineering and Informational Sciences. Since 2018\, he has been the Director of the EPI-One Lab\, leading various applied projects with industry partners such as Huawei and Webank. He holds several patents in areas such as large-scale production planning and blockchain consensus mechanism design. He earned his Ph.D. in Operations Research from the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology in 2009. He also holds an M.S. in Mathematics from Ohio State University and a B.S. in Mathematics from Nanjing University.
URL:https://iora.nus.edu.sg/events/dao-isem-iora-seminar-series-jiheng-zhang/
CATEGORIES:IORA Seminar Series
END:VEVENT
END:VCALENDAR