Mohammad Delasay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mohammad Delasay has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Armann Ingolfsson
Alberta School of Business, University of Alberta, Edmonton, AB, Canada
3 shared publications - Bora Kolfal
Department of Accounting and Business Analytics, University of Alberta School of Business, Edmonton, Canada
3 shared publications Mustafa Akan
Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15217
3 shared publicationsSherwin Doroudi
Stony Brook University, New York, United States of America
3 shared publications- Siddharth Prakash Singh
School of Management, University College London, London E14 5AA, United Kingdom
3 shared publications Aditya Jain
Zicklin School of Business, Baruch College, New York, New York, USA
2 shared publications
Latest Publications
- 22 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
Delay Information Sharing in Two-Sided On-Demand Platforms
Problem definition: We study delay information disclosure policies for on-demand platforms serving two user classes (customers and providers) who seek matches using the platform. The platform’s objective is to maximize the match rate by choosing the level of information—no information, binary information (indicating whether the wait is zero or nonzero), or occupancy information (indicating the expected delay based on the number of users currently in the system)—to disclose to each user class. Users of each class decide whether to join or balk based on the delay information disclosed to them. Methodology/results: We consider two user types in each class: patient users who are willing to wait for a match and impatient users who are not. We use continuous-time Markov chains to model the system as two-sided queues and employ equilibrium analysis to characterize users’ joining behavior and the platform’s match rate under each disclosure policy. We show that the two-sided system decouples and that disclosure decisions can be analyzed as two one-sided systems only if some level of information (binary or occupancy) is disclosed to both user classes. We find that disclosing binary information dominates disclosing no information or occupancy information to a user class when its patient users are sufficiently patient, whereas disclosing occupancy information dominates disclosing binary information to a user class when there are enough patient users. Numerical experiments show that disclosing occupancy information to both user classes is typically not suboptimal by much. We find that compared with the platform’s optimal disclosure choice, a user class may prefer more or less granular information for themselves or the other class. This utility analysis does not lend itself to decoupling. Managerial implications: Our findings hold crucial implications for platform managers; carefully evaluating the chosen information-sharing strategy is imperative, and guidelines from the one-sided literature are generally inadequate for making disclosure decisions. Funding: S. P. Singh acknowledges support from the University College London School of Management [Grant 100032871], M. Delasay acknowledges support from Stony Brook University [Trustees Faculty Award], and M. Akan acknowledges support the National Science Foundation [CAREER Award 1351821]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2025.0482 .
- 22 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
Delay Information Sharing in Two-Sided On-Demand Platforms
Problem definition: We study delay information disclosure policies for on-demand platforms serving two user classes (customers and providers) who seek matches using the platform. The platform’s objective is to maximize the match rate by choosing the level of information—no information, binary information (indicating whether the wait is zero or nonzero), or occupancy information (indicating the expected delay based on the number of users currently in the system)—to disclose to each user class. Users of each class decide whether to join or balk based on the delay information disclosed to them. Methodology/results: We consider two user types in each class: patient users who are willing to wait for a match and impatient users who are not. We use continuous-time Markov chains to model the system as two-sided queues and employ equilibrium analysis to characterize users’ joining behavior and the platform’s match rate under each disclosure policy. We show that the two-sided system decouples and that disclosure decisions can be analyzed as two one-sided systems only if some level of information (binary or occupancy) is disclosed to both user classes. We find that disclosing binary information dominates disclosing no information or occupancy information to a user class when its patient users are sufficiently patient, whereas disclosing occupancy information dominates disclosing binary information to a user class when there are enough patient users. Numerical experiments show that disclosing occupancy information to both user classes is typically not suboptimal by much. We find that compared with the platform’s optimal disclosure choice, a user class may prefer more or less granular information for themselves or the other class. This utility analysis does not lend itself to decoupling. Managerial implications: Our findings hold crucial implications for platform managers; carefully evaluating the chosen information-sharing strategy is imperative, and guidelines from the one-sided literature are generally inadequate for making disclosure decisions. Funding: S. P. Singh acknowledges support from the University College London School of Management [Grant 100032871], M. Delasay acknowledges support from Stony Brook University [Trustees Faculty Award], and M. Akan acknowledges support the National Science Foundation [CAREER Award 1351821]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2025.0482 .
- 28 April 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 361 (2) , 637-679
Scalable Load Balancing in Interference-prone Queueing Systems
- 28 April 2026
- Published by Springer Nature in Annals of Operations Research
- Vol. 361 (2) , 637-679
Scalable Load Balancing in Interference-prone Queueing Systems
- Open Access
- 16 March 2026
- Published by Elsevier in SSRN Electronic Journal
AI for Operational Efficiency in Virtual Care: An Operations-Focused Framework
This chapter examines how Artificial Intelligence (AI) enhances operational efficiency in virtual care, including telehealth, mHealth, remote monitoring, and econsultations. From an operations management perspective, the chapter analyzes how AI can be employed such that it improves workflow design, capacity utilization, system throughput, and care quality. It reviews current AI applications in virtual care across three functional domains of workflow automation, optimization for risk assessment, and capacity and demand prediction. AI tools currently implemented in these functional domains include AI-driven triage agents, ambient documentation systems, anomaly filtering models, risk stratification algorithms, and no-show prediction algorithms. The chapter also introduces the Operations-Focused AI Adaptation (OFAA) framework, a two-tier model that guides healthcare organizations in evaluating and integrating AI solutions. The first tier assesses the need for an AI solution by evaluating its clinical integrity, operational impact, effect on patient experience, and equity. The second tier provides a four-phase implementation roadmap emphasizing strategic alignment in the care value stream map, workflow and capacity analysis, monitoring and quality control, and continuous governance and improvement. The OFAA framework ensures AI adoption is aligned, measurable, scalable, and sustainable in virtual care systems.
- 16 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAI for Operational Efficiency in Virtual Care: An Operations-Focused Framework
This chapter examines how Artificial Intelligence (AI) enhances operational efficiency in virtual care, including telehealth, mHealth, remote monitoring, and econsultations. From an operations management perspective, the chapter analyzes how AI can be employed such that it improves workflow design, capacity utilization, system throughput, and care quality. It reviews current AI applications in virtual care across three functional domains of workflow automation, optimization for risk assessment, and capacity and demand prediction. AI tools currently implemented in these functional domains include AI-driven triage agents, ambient documentation systems, anomaly filtering models, risk stratification algorithms, and no-show prediction algorithms. The chapter also introduces the Operations-Focused AI Adaptation (OFAA) framework, a two-tier model that guides healthcare organizations in evaluating and integrating AI solutions. The first tier assesses the need for an AI solution by evaluating its clinical integrity, operational impact, effect on patient experience, and equity. The second tier provides a four-phase implementation roadmap emphasizing strategic alignment in the care value stream map, workflow and capacity analysis, monitoring and quality control, and continuous governance and improvement. The OFAA framework ensures AI adoption is aligned, measurable, scalable, and sustainable in virtual care systems.
- 12 August 2024
- Published by Springer Nature in Annals of Operations Research
- p. 1-40
Efficient allocation of load-balancing and differentiation tasks in tandem queue services
- 12 August 2024
- Published by Springer Nature in Annals of Operations Research
- p. 1-40
Efficient allocation of load-balancing and differentiation tasks in tandem queue services
- 6 March 2024
- Published by SAGE Publications in Production and Operations Management
- Vol. 33 (3) , 737-756
Prioritization in the Presence of Self-ordering Opportunities in Omnichannel Services
Motivated by the popularity of mobile-order-and-pay applications, especially in fast-casual food restaurants and coffee shops, we study omnichannel service systems—where customers can employ mobile applications for self-ordering—with respect to sojourn times, throughput, and social welfare. Our models are two-stage queues with two customer classes: Walk-ins and mobiles. We identify Pareto efficient prioritization policies, highlighting trade-offs between each class’s mean sojourn times. We allow customers to make strategic joining decisions based on their anticipated delays under an information structure where walk-ins observe partial queue length information. We draw from a wide array of techniques, including steady-state, transient, busy period, hitting-time analyses, and matrix analytic methods. We showcase the significance of prioritization on the system throughput and social welfare. We demonstrate settings where a traditional service system’s (typically beneficial) transformation to an omnichannel reduces throughput. Our analysis highlights the importance of prioritization policy choice for an efficient transition to an omnichannel service system. The throughput-optimal policy choice highly depends on the operational parameters and customer patience levels; implementing a wrong policy can yield a significant loss in throughput and profitability.
- 6 March 2024
- Published by SAGE Publications in Production and Operations Management
- Vol. 33 (3) , 737-756
Prioritization in the Presence of Self-ordering Opportunities in Omnichannel Services
Motivated by the popularity of mobile-order-and-pay applications, especially in fast-casual food restaurants and coffee shops, we study omnichannel service systems—where customers can employ mobile applications for self-ordering—with respect to sojourn times, throughput, and social welfare. Our models are two-stage queues with two customer classes: Walk-ins and mobiles. We identify Pareto efficient prioritization policies, highlighting trade-offs between each class’s mean sojourn times. We allow customers to make strategic joining decisions based on their anticipated delays under an information structure where walk-ins observe partial queue length information. We draw from a wide array of techniques, including steady-state, transient, busy period, hitting-time analyses, and matrix analytic methods. We showcase the significance of prioritization on the system throughput and social welfare. We demonstrate settings where a traditional service system’s (typically beneficial) transformation to an omnichannel reduces throughput. Our analysis highlights the importance of prioritization policy choice for an efficient transition to an omnichannel service system. The throughput-optimal policy choice highly depends on the operational parameters and customer patience levels; implementing a wrong policy can yield a significant loss in throughput and profitability.
- Open Access
- 1 January 2024
- Published by Elsevier in SSRN Electronic Journal
Efficient Allocation of Load-Balancing and Differentiation Tasks in Tandem Queue Services
Within service systems, tasks can encompass diverse functionalities. In a two-phase queuing model featuring two customer priority classes, our study discerns two distinct task functionalities executed by the first-phase server (referred to as the auxiliary server). These tasks aim to facilitate priority-based service by the second-phase server (referred to as the expert). Load-balancing tasks alleviate the expert's workload, while differentiation tasks enhance accurate customer prioritization in the second phase by reducing misclassification. With customers queuing for both the auxiliary server and the expert in tandem, our investigation focuses on determining the optimal allocation of the auxiliary server’s time between these load-balancing and differentiation tasks. Through queuing optimization, we minimize customers' expected total delay cost. In scenarios where the auxiliary server is allowed to perform only one task type (either load-balancing or differentiation), we delineate the optimal solutions based on specific functional forms dictating the server's efficiency in executing each task type. These solutions strike a balance between excess phase capacities and the square root of marginal cost-to-saving ratios arising from each task type. Additionally, we partially characterize the optimal solution in scenarios permitting both load-balancing and differentiation tasks. Notably, under high system loads, executing load-balancing tasks proves more efficient than differentiation tasks. However, the relationship between the optimal task durations and system load showcases a non-monotonic pattern. As AI decision support products increasingly enable expert providers to delegate "routine" tasks to mid-level providers, our study sheds light on the efficient allocation of different tasks to different provider types to minimize delay costs in service systems.
- 1 January 2024
- Published by Elsevier in SSRN Electronic Journal
Open AccessEfficient Allocation of Load-Balancing and Differentiation Tasks in Tandem Queue Services
Within service systems, tasks can encompass diverse functionalities. In a two-phase queuing model featuring two customer priority classes, our study discerns two distinct task functionalities executed by the first-phase server (referred to as the auxiliary server). These tasks aim to facilitate priority-based service by the second-phase server (referred to as the expert). Load-balancing tasks alleviate the expert's workload, while differentiation tasks enhance accurate customer prioritization in the second phase by reducing misclassification. With customers queuing for both the auxiliary server and the expert in tandem, our investigation focuses on determining the optimal allocation of the auxiliary server’s time between these load-balancing and differentiation tasks. Through queuing optimization, we minimize customers' expected total delay cost. In scenarios where the auxiliary server is allowed to perform only one task type (either load-balancing or differentiation), we delineate the optimal solutions based on specific functional forms dictating the server's efficiency in executing each task type. These solutions strike a balance between excess phase capacities and the square root of marginal cost-to-saving ratios arising from each task type. Additionally, we partially characterize the optimal solution in scenarios permitting both load-balancing and differentiation tasks. Notably, under high system loads, executing load-balancing tasks proves more efficient than differentiation tasks. However, the relationship between the optimal task durations and system load showcases a non-monotonic pattern. As AI decision support products increasingly enable expert providers to delegate "routine" tasks to mid-level providers, our study sheds light on the efficient allocation of different tasks to different provider types to minimize delay costs in service systems.
- Open Access
- 1 March 2023
- Published by SAGE Publications in Production and Operations Management
- Vol. 32 (3) , 863-881
Real‐time delay announcement under competition
Internet‐based technology enables firms to disseminate real‐time delay information to delay‐sensitive customers. We study how such delay announcements impact service providers in a competitive environment with two service providers who compete for market share. We model the service providers' strategies based on an endogenous timing game, investigating strategies that emerge in equilibrium. We determine the service providers' market shares under the various game outcomes by analyzing continuous‐time Markov chains, which capture customers' joining decisions, and by developing a novel computational technique to analyze the intractable asymmetric Join‐the‐Shortest Queue system, providing bounds on the market shares. We find that only the lower capacity service provider announces its real‐time delay under intermediate system loads and highly imbalanced capacities. However, for most parameter settings, the mere presence of a competitor induces both providers to announce delays in equilibrium, leaving customers better off on average. We relate our findings to the single‐provider delay announcement literature by discussing the impact of competition on service providers, delay announcement technology firms, and customers.
- 1 March 2023
- Published by SAGE Publications in Production and Operations Management
- Vol. 32 (3) , 863-881
Open AccessReal‐time delay announcement under competition
Internet‐based technology enables firms to disseminate real‐time delay information to delay‐sensitive customers. We study how such delay announcements impact service providers in a competitive environment with two service providers who compete for market share. We model the service providers' strategies based on an endogenous timing game, investigating strategies that emerge in equilibrium. We determine the service providers' market shares under the various game outcomes by analyzing continuous‐time Markov chains, which capture customers' joining decisions, and by developing a novel computational technique to analyze the intractable asymmetric Join‐the‐Shortest Queue system, providing bounds on the market shares. We find that only the lower capacity service provider announces its real‐time delay under intermediate system loads and highly imbalanced capacities. However, for most parameter settings, the mere presence of a competitor induces both providers to announce delays in equilibrium, leaving customers better off on average. We relate our findings to the single‐provider delay announcement literature by discussing the impact of competition on service providers, delay announcement technology firms, and customers.
- Open Access
- 1 January 2023
- Published by Elsevier in SSRN Electronic Journal
Delay Information Sharing in Two-Sided Queues
We study delay information disclosure policies in on-demand platforms, modeled as two-sided queues, with two user classes --- customers and providers --- who seek matches to each other using the platform. The primary objective is maximizing the rate at which these matches occur by adopting one of three information regimes: the occupancy regime (disclosing the current system occupancy to both user categories) or two distinct asymmetric regimes (sharing no information with one user class while sharing occupancy information with the other). The users of each class are strategic and decide whether to join based on the available delay information. We use continuous-time Markov chains to model the system as a two-sided queue and employ equilibrium analysis to characterize the users' joining behavior and the platform's match rate under each information regime. The optimal policy reveals a complex dependence on system parameters and is strongly influenced by the users' patience profiles. We demonstrate analytically that it is strategically advantageous to withhold delay information from one user class, especially when it consists of a substantial number of relatively delay-insensitive users. The optimality of the asymmetric information-sharing regimes becomes more prevalent as the discrepancy in the patience profiles or the market sizes of the two user classes increases. However, our extensive numerical analyses find that the occupancy regime proves to be optimal in many other settings. In cases where it falls short of optimality, the sub-optimality gap is usually minimal (on average, about 5%). Our findings hold crucial implications for platform managers, indicating that in such two-sided systems, the occupancy regime is a safe choice unless the two user classes exhibit a large patience profile discrepancy or a large market size imbalance. In such cases, opting for the occupancy information regime could adversely impact the platform's match rate. In such situations, carefully evaluating the chosen information-sharing strategy becomes imperative.
- 1 January 2023
- Published by Elsevier in SSRN Electronic Journal
Open AccessDelay Information Sharing in Two-Sided Queues
We study delay information disclosure policies in on-demand platforms, modeled as two-sided queues, with two user classes --- customers and providers --- who seek matches to each other using the platform. The primary objective is maximizing the rate at which these matches occur by adopting one of three information regimes: the occupancy regime (disclosing the current system occupancy to both user categories) or two distinct asymmetric regimes (sharing no information with one user class while sharing occupancy information with the other). The users of each class are strategic and decide whether to join based on the available delay information. We use continuous-time Markov chains to model the system as a two-sided queue and employ equilibrium analysis to characterize the users' joining behavior and the platform's match rate under each information regime. The optimal policy reveals a complex dependence on system parameters and is strongly influenced by the users' patience profiles. We demonstrate analytically that it is strategically advantageous to withhold delay information from one user class, especially when it consists of a substantial number of relatively delay-insensitive users. The optimality of the asymmetric information-sharing regimes becomes more prevalent as the discrepancy in the patience profiles or the market sizes of the two user classes increases. However, our extensive numerical analyses find that the occupancy regime proves to be optimal in many other settings. In cases where it falls short of optimality, the sub-optimality gap is usually minimal (on average, about 5%). Our findings hold crucial implications for platform managers, indicating that in such two-sided systems, the occupancy regime is a safe choice unless the two user classes exhibit a large patience profile discrepancy or a large market size imbalance. In such cases, opting for the occupancy information regime could adversely impact the platform's match rate. In such situations, carefully evaluating the chosen information-sharing strategy becomes imperative.
- 21 April 2022
- Published by SAGE Publications in Production and Operations Management
- Vol. 31 (5) , 2237-2255
Impacts of the COVID‐19 pandemic on grocery retail operations: An analytical model
The COVID‐19 pandemic has had profound effects on grocery retailers, forcing them to make many operational changes in response to public health concerns and the shift in customers' shopping behavior. Grocery retailers need to understand the impact of pandemic conditions on their operations, but the literature has not modeled and analyzed this issue. We bridge this gap through economic models that consider the documented changes in the customers' shopping behavior during the COVID‐19 pandemic, including less frequent in‐store shopping and bulk‐shopping tendency. We capture the impact of occupancy limitation guidelines on grocery retailers' service capacity, customers' shopping behavior, and, consequently, on the retailers' store traffic and profit. We find that though store occupancy limitations reduce the in‐store foot traffic (which helps with curbing the disease spread), interestingly, they do not necessarily result in a profit decline. Under occupancy limitations and when the retailer offers the delivery or curbside pickup service, our analyses highlight the externality impact of online customers on the shopping behavior of in‐store customers. When the retailer adds the delivery service, such externalities may increase the store traffic (higher infection risk inside the grocery store) and reduce the retailer's profit. When the retailer adds the curbside pickup instead, it has more control over the impact of externalities, which helps in lowering the store traffic and increasing the profit. Our results offer valuable insights into how retailers should regard occupancy limitations and health safety measures. Our results also highlight conditions under which various operating modes may help retailers reduce infection risk and achieve higher profit.
- 21 April 2022
- Published by SAGE Publications in Production and Operations Management
- Vol. 31 (5) , 2237-2255
Impacts of the COVID‐19 pandemic on grocery retail operations: An analytical model
The COVID‐19 pandemic has had profound effects on grocery retailers, forcing them to make many operational changes in response to public health concerns and the shift in customers' shopping behavior. Grocery retailers need to understand the impact of pandemic conditions on their operations, but the literature has not modeled and analyzed this issue. We bridge this gap through economic models that consider the documented changes in the customers' shopping behavior during the COVID‐19 pandemic, including less frequent in‐store shopping and bulk‐shopping tendency. We capture the impact of occupancy limitation guidelines on grocery retailers' service capacity, customers' shopping behavior, and, consequently, on the retailers' store traffic and profit. We find that though store occupancy limitations reduce the in‐store foot traffic (which helps with curbing the disease spread), interestingly, they do not necessarily result in a profit decline. Under occupancy limitations and when the retailer offers the delivery or curbside pickup service, our analyses highlight the externality impact of online customers on the shopping behavior of in‐store customers. When the retailer adds the delivery service, such externalities may increase the store traffic (higher infection risk inside the grocery store) and reduce the retailer's profit. When the retailer adds the curbside pickup instead, it has more control over the impact of externalities, which helps in lowering the store traffic and increasing the profit. Our results offer valuable insights into how retailers should regard occupancy limitations and health safety measures. Our results also highlight conditions under which various operating modes may help retailers reduce infection risk and achieve higher profit.