Emerging technologies can help organizations identify improved trade-offs between profitability objectives and sustainability imperatives. However, their full potential can be challenging to realize. One reason is that contemporary firms are embedded in a complex network of interlinked supply chains. Driven by data and insights from practice, my research aims to answer the following questions: How can novel business models shift the frontier between profitability and sustainability? Can innovative technologies (such as AI, IoT, blockchain) support this shift, and how should firms manage adoption barriers? What role, precisely, does the complex supply chain network play in which the firm is embedded, and how can this network be represented effectively?

Publications and Accepted Papers

Here you can find links to my publications in Operations journals.

We propose an exact linear programming (LP)-based solution approach to the Guaranteed Service Model (GSM), one of the most widely applied models for optimizing safety stock placement in supply chain networks. Our approach handles any directed acyclic network and any cost function that depends on a stage's incoming and outgoing service times. It scales polynomially in the number of nodes n in the network, pseudo-polynomially wrt the bit size of the maximum replenishment time M, and, (for fixed M) exponentially in its treewidth, which quantifies how “tree-like” a network is, and can be much smaller than n. This contrasts with existing approaches, which scale exponentially in n. The proof of exactness relies crucially on showing that the join of transportation-like polytopes remains integral, and is more broadly applicable to other Operations Management problems. In addition to an exact formulation, our LP-based approach enables a practical solution strategy for the GSM built on a hierarchy of LP relaxations. These relaxations provide valid lower bounds, certify optimality when integral, and can strengthen existing exact methods. In our computational study, the smallest relaxation already recovers an optimal GSM solution on every real-world instance from Willems (2008), leading to substantial speed-ups over the state-of-the-art exact algorithm and commercial general-purpose solvers. The framework also supports sensitivity analysis and accommodates additional operational constraints. Overall, our approach builds a new bridge between Operations Management and Computer Science, providing new theoretical foundations and practical tools for managing safety stocks in complex modern supply chain networks.

With Andre Calmon (Georgia Tech), Georgina Hall (INSEAD), & Mohit Tawarmalani (Purdue University).
Accepted for publication in Management Science. Available here.
Modern traceability technologies promise to improve supply chain management by simplifying recalls, increasing visibility, or verifying sustainable supplier practices. Initiatives leading the implementation of traceability technologies must choose the least-costly set of firms—or seed set—to target for early adoption. Choosing this seed set is challenging because firms are part of supply chains interlinked in complex networks, yielding an inherent supply chain effect: benefits obtained from traceability are conditional on technology adoption by a subset of firms in a product's supply chain. We prove that the problem of selecting the least-costly seed set in a supply chain network is hard to solve and even approximate within a polylogarithmic factor. Nevertheless, we provide a novel linear programming-based algorithm to identify the least-costly seed set. The algorithm is fixed-parameter tractable in the supply chain network's treewidth, which we show to be low in real-world supply chain networks. The algorithm also enables us to derive easily-computable bounds on the cost of selecting an optimal seed set. Finally, we leverage our algorithms to conduct large-scale numerical experiments that provide insights into how the supply chain network structure influences diffusion. These insights can help managers optimize their technology diffusion strategy.

With Andre Calmon (Georgia Tech) & Georgina Hall (INSEAD).
Published in Management Science, 2025, Volume 71, Issue 1.
Check out the INSEAD Knowledge article based on our paper!
Technological advances enable new business models for heavy equipment manufacturers wherein customers access equipment without ownership. We seek to understand the profitability and environmental performance of different emerging business models in light of salient economic and operational factors. We develop a game-theoretic model to identify the optimal choice between a traditional ownership-based business model and two access-based models: servicization and peer-to-peer sharing. After-sales services, equipment characteristics, usage environments, and fuel prices affect this choice. We also provide a novel framework to analyze business models' environmental impact, which incorporates trade-offs between economic value and environmental costs and shows that all models may create win-win situations for the manufacturer and the environment.

With Niyazi Taneri (Cambridge University) & Sameer Hasija (INSEAD).
Published in Operations Research, 2024, Volume 72, Issue 6.
Family planning services play a central role in the sustainable development agenda by improving health and education while reducing poverty and gender inequality. Marie Stopes International (MSI) reaches underserved clients in rural areas with the help of mobile healthcare units (MHUs). This approach is gaining traction more generally to enable broad access to health services for marginalized rural populations, thus stepping closer to fulfilling SDG 3: Good Health and Well-Being. Our research addresses the complex challenge of allocating limited mobile healthcare unit resources to create the largest possible impact in the long-term, especially in light of intricate demand dynamics.
We model the MHU resource allocation problem as the optimization of a sum of sigmoidal functions and derive new theoretical results with operationalizable managerial insights. We further develop a machine learning approach to predict demand in such a setting that provides interpretable results, a key requirement in the humanitarian context. Our empirical application combines MSI's client demand data with rich, publicly available data sources. We use the resulting estimates to demonstrate the benefits of our analytically derived insights.

With Andres Alban (Frankfurt School of Finance & Management), Harwin de Vries (Erasmus University), & Luk Van Wassenhove (INSEAD).
Published in Manufacturing & Service Operations Management, 2022, Volume 24, Issue 6.
Finalist, 2022 MSOM Society Award for Responsible Research in Operations Management.

Selected Works in Progress

Here you can find a description of some of my ongoing research projects.

Supply chain problems are frequently formulated as optimization problems over graphs representing complex networks of interlinked input-output relationships. Frequently, these problems are hard, so researchers rely on analyzing stylized structures or developing approximate solutions. Yet, a scarcity of real-world data has hindered our understanding of how exact and approximate solutions perform in practice and whether managerial insights carry over from these simplified settings. We address this critical gap by introducing RG4SC, a versatile random graph model for creating "test tracks" for supply chain management research. RG4SC's simple micro-foundations and interpretable input parameters allow for systematically generating diverse and realistic network structures. We demonstrate its empirical validity and that it more adequately represents real-world supply chain networks than existing random models. We then showcase RG4SC's utility for research through a case study on the Guaranteed Service Model (GSM), a widely used framework for safety stock optimization. Our analysis shows how RG4SC can be central to uncovering novel managerial insights, analyzing the computational complexity of algorithms, benchmarking heuristics, and training machine learning models. RG4SC is accessible through a user-friendly web interface at https://scngenerator.pythonanywhere.com/.

With Andre Calmon (Georgia Tech) & Georgina Hall (INSEAD).
Reject and resubmit at Management Science. A draft is available here.
Invited for presentation at the 2024 MSOM Supply Chain Management SIG.
Organizations increasingly use algorithmic tools to guide operational decisions that remain formally in human hands. These tools can improve assisted execution, but they can also change how users engage with the task and what they can do once guidance is unavailable, stale, or requires oversight. We study how the \emph{precision} of algorithmic advice shapes a reward-learning frontier: the trade-off between contemporaneous performance under advice and unsupported performance after advice is removed.
We develop a stylized model of advice-taking and transfer across environments. Precise advice gives an executable action and improves short-run performance through higher compliance. Broad advice gives a coarsened action rule, requires users to map that rule into an action, and can preserve more portable decision strategies when the subsequent environment is related but not identical. We test these predictions in two online experiments using an electric-vehicle routing and charging task with stochastic traffic and nonlinear charging costs. Precise numerical advice delivers the largest gains during the advice phase. Study~2 introduces a specific-broad treatment that keeps advice qualitative while adding operational detail. Its performance shows that strategic detail alone does not close the short-run reward gap, identifying the action-mapping burden as central. After advice is removed, broad and specific-broad advice yield higher baseline-adjusted unsupported performance relative to precise advice under moderate transfer. This advantage is close to zero when transfer is minimal and disappears under far transfer. Behavioral measures and inverse reinforcement learning estimates further distinguish transient compliance from more persistent shifts in decision strategy.
Advice systems should be evaluated not only by performance while recommendations are available, but also by the decision capability users retain when guidance is absent, imperfect, or requires meaningful supervision.

With Park Sinchaisri (UC, Berkeley).
Major revision at Manufacturing & Service Operations Management.
Firms and policy makers face many resource allocation decisions. Often, these decisions cannot be made purely based on utilitarian considerations but capture some notion of fairness. Operations Management has provided a deep understanding of the trade-off between fairness and efficiency but has often ignored the uncertainty inherent in evaluating resource allocations. One fundamental reason for this uncertainty stems from imperfect information gathering. For example, in a push to achieve net-zero emissions, governments increasingly impose restrictions, such as congestion charges, without accurately understanding the effects of such restrictions on different sub-populations.
Building on a distributionally robust optimization framework, we study how the "price of fairness" is affected by uncertainty in the impact of different policies. We demonstrate that ignoring uncertainty can systematically bias decisions away from disadvantaged sub-populations. We then analyze how information-gathering activities can mitigate this bias and how these activities should optimally be targeted.

With Chengxin Yan (Singapore Management University) & Peter Zhang (Carnegie Mellon University).
Analysis in progress.

Contact

Email: pblaettchen α smu.edu.sg

Design by W3layouts