ASAlan Scheller-Wolf

Alan Scheller-Wolf

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Alan Scheller-Wolf has a total of 66 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Sequential vs. Synchronized Entanglement Swapping: QKD Secret-Key Rate under Optimized Link-Layer Control

    by Priyam Srivastava, Akshat R. Sabavat, Siddharth Jain, Alan Scheller-Wolf, Sridhar Tayur, David Tipper, Prashant Krishnamurthy, Amy Babay, Kaushik Seshadreesan

    Quantum repeater chains build long-distance entanglement for quantum key distribution (QKD) by creating pairs on short links and joining them through entanglement swapping. Because stored pairs lose fidelity while they wait, swap timing can affect the secret-key rate. We study how network-layer swap scheduling affects six-state QKD on a simulated four-hop chain under an idealized Werner-state noise model. We compare a sequential (swap-and-wait) discipline, which builds and stores partial chains, with a synchronized (wait-and-swap) discipline, which waits until all links are ready before swapping. Both use the same reinforcement-learned link controllers, isolating the effect of the swapping discipline. When stored pairs cannot retain sufficient fidelity for one network time step, our sequential implementation produces no key, while synchronized retains a small key rate from simultaneous link deliveries. Once sequential becomes viable, it outperforms synchronized by up to 19.1% in the homogeneous chains studied, with the advantage decreasing as memory lifetime increases. We predict the synchronized short-memory pair-delivery rate from link-delivery statistics and derive a closed-form condition for when sequential can preserve progress across time steps. We also examine chains with one slower link, where partial chains can wait and decay at the bottleneck. In this setting, synchronized slightly outperforms sequential at longer memory lifetimes. Moving the slow link has little effect on key rate away from the transition region but strongly affects sequential link-buffer occupancy. Choosing a swapping discipline therefore depends not only on whether memories can preserve partial progress, but also on how the link configuration determines where that progress must wait and decay.

  • Improving Upon the Generalized c μ Rule: A Whittle Approach

    by Zhouzi Li, Keerthana Gurushankar, Mor Harchol-Balter, Alan Scheller-Wolf

    Better Scheduling When the Cost of Delay Grows over Time Imagine a stream of jobs, in which each job costs us some money (a holding cost) for every hour that it is not complete. Furthermore, the holding cost of each job can increase over time and possibly even jump up at deadlines associated with the job. To minimize the rate at which we hemorrhage money, it is common to deploy well-known strategies such as the celebrated generalized c-mu rule, which prioritizes scheduling jobs based on their instantaneous holding cost. However, this approach is limited: it ignores how costs rise in the future; for example, a job with a deadline might be ignored until after the deadline is missed. Li, Gurushankar, Harchol-Balter, and Scheller-Wolf tackle this time-varying holding cost problem by translating it into a restless multiarmed bandit, which they use to derive a Whittle index. This leads to a new priority rule that accounts for how both holding costs and workloads evolve in the future. Their rule is simple to implement, yet it is remarkably robust, consistently outperforming all known heuristics across a wide range of settings.

  • Open Access

    When does partial priority improve revenue?

    by Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf

    Priority queues have long been used to increase revenue by exploiting the fact that time-sensitive customers are willing to pay for shorter waiting times. This fact begs the question: Can one make even more revenue by relaxing the strictness of the priority policy? This paper answers this question under the unobservable queue setting, where customers are heterogeneous in their time-sensitivity; specifically the time-sensitivity of customers is allowed to follow an arbitrary distribution. In this paper, we prove necessary and sufficient conditions under which partial priority can increase the revenue. Specifically, we find a surprising result: Although partial priority offers much more flexibility than strict priority, partial priority only increases revenue if there are two additional constraints on the service provider, one setting a maximum price and the other setting a maximum waiting time. In the absence of either of these constraints, we prove that strict priority maximizes revenue. Finally, in situations where partial priority increases the revenue, we analytically characterize the amount of improvement.

  • Open Access

    LookAhead: the optimal non-decreasing index policy for a time-varying holding cost problem

    by Keerthana Gurushankar, Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf

    In practice, the cost of delaying a job can grow as the job waits. Such behavior is modeled by the time-varying holding cost (TVHC) problem, where each job’s instantaneous holding cost increases with its current age (a job’s age is the time since it arrived). The goal of the TVHC problem is to find a scheduling policy that minimizes the time-average total holding cost across all jobs. However, no optimality results are known for the TVHC problem outside of the asymptotic regime. In this paper, we study a simple yet still challenging special case: A two-class M/M/1 queue in which class 1 jobs incur a non-decreasing, time-varying holding cost and class 2 jobs incur a constant holding cost. Our main contribution is deriving the first optimal (non-decreasing) index policy for this special case of the TVHC problem. Our optimal policy, called LookAhead, stems from the following idea: Rather than considering each job’s current holding cost when making scheduling decisions, we should look at their cost some X time into the future, where this X is intuitively called the “lookahead amount." This paper derives that optimal lookahead amount.

  • Open Access

    LookAhead: The Optimal Non-decreasing Index Policy for a Time-Varying Holding Cost problem

    by Keerthana Gurushankar, Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf

    In practice, the cost of delaying a job can grow as the job waits. Such behavior is modeled by the Time-Varying Holding Cost (TVHC) problem, where each job's instantaneous holding cost increases with its current age (a job's age is the time since it arrived). The goal of the TVHC problem is to find a scheduling policy that minimizes the time-average total holding cost across all jobs. However, no optimality results are known for the TVHC problem outside of the asymptotic regime. In this paper, we study a simple yet still challenging special case: A two-class M/M/1 queue in which class 1 jobs incur a non-decreasing, time-varying holding cost and class 2 jobs incur a constant holding cost. Our main contribution is deriving the first optimal (non-decreasing) index policy for this special case of the TVHC problem. Our optimal policy, called LookAhead, stems from the following idea: Rather than considering each job's current holding cost when making scheduling decisions, we should look at their cost some $X$ time into the future, where this $X$ is intuitively called the ``lookahead amount." This paper derives that optimal lookahead amount.

  • Split Liver Transplantation: An Analytical Decision Support Model

    by Yanhan (Savannah) Tang, Alan Scheller-Wolf, Sridhar Tayur, Emily R. Perito, John P. Roberts

    This research study introduces a decision support model for split liver transplantation (SLT). SLT is a procedure that can save two lives with one donated liver, thereby increasing the total benefit derived from the limited number of donated livers available. SLT may also improve equity by giving transplant candidates who are physically smaller, including children, increased access to liver transplants. However, SLT is rarely used in the United States. To help quantify the benefits of increased SLT utilization and provide decision support tools, this research presents a deceased-donor liver allocation model that incorporates both efficiency and fairness objectives. We formulate the liver waitlists as a multiqueue fluid system, incorporating specifics of donor-recipient size matching and patients’ dynamically changing health conditions. Leveraging a novel decomposition result, the study finds the exact optimal matching procedure, enabling policy makers to benchmark the performance of different allocation policies against the theoretical optimal. Numerical results, utilizing data from the Organ Procurement and Transplantation Network, show that increased utilization of SLT can significantly reduce patient deaths, increase total quality-adjusted life years, and improve fairness among different patient groups.


  • Child Welfare Services in the United States: An Operations Research Perspective

    by Vincent W. Slaugh, Ludwig Dierks, Alan Scheller-Wolf, Andrew C. Trapp, M. Utku Ünver


  • Multi-Armed Bandits with Endogenous Learning Curves: An Application to Split Liver Transplantation

    by Yanhan (Savannah) Tang, Andrew Li, Alan Scheller-Wolf, Sridhar Tayur

    Problem Definition: Proficiency in many sophisticated tasks is attained through experience-based learning, in other words, learning by doing. For example, transplant centers’ surgical teams need to practice difficult surgeries to master the skills required. Meanwhile, this experience-based learning may affect other stakeholders, such as patients eligible for transplant surgeries, and require resources, including scarce organs and continual efforts. To ensure that patients have excellent outcomes and equitable access to organs, the organ allocation authority needs to quickly identify and develop medical teams with high aptitudes. This entails striking a balance between exploring surgical combinations with initially unknown full potential and exploiting existing knowledge based on observed outcomes. Methodology/results: We formulate a multi-armed bandit (MAB) model in which parametric learning curves are embedded in the reward functions to capture endogenous experience-based learning. In addition, our model includes provisions ensuring that the choices of arms are subject to fairness constraints to guarantee equity. To solve our MAB problem, we propose the L-UCB and FL-UCB algorithms, variants of the upper confidence bound (UCB) algorithm that attain the optimal [ ] regret on problems enhanced with experience-based learning and fairness concerns. We demonstrate our model and algorithms on the split liver transplantation (SLT) allocation problem, showing that our algorithms have superior numerical performance compared with standard bandit algorithms in a setting where experience-based learning and fairness concerns exist. Managerial implications: From a methodological point of view, our proposed MAB model and algorithms are generic and have broad application prospects. From an application standpoint, our algorithms could be applied to help evaluate potential strategies to increase the proliferation of SLT and other technically difficult procedures. Funding: The authors acknowledge the support of CMU Tepper’s Health Care Initiative Funding. Supplemental Material: The electronic companion is available at https://doi.org/10.1287/msom.2022.0412 .


  • Technical Note—Optimal Procurement in Remanufacturing Systems with Uncertain Used-Item Condition

    by Emre Nadar, Mustafa Akan, Laurens Debo, Alan Scheller-Wolf

    The Importance of Considering System Congestion When Acquiring Used Items for Remanufacturing The condition of used items obtained by remanufacturers often varies widely and may only be truly known after an inspection. In “Technical Note–Optimal Procurement in Remanufacturing Systems with Uncertain Used-Item Condition,” Nadar, Akan, Debo, and Scheller-Wolf study the procurement problem by taking into account this pre-inspection uncertainty as well as the quantities of available used items of different quality levels. The authors provide a novel optimal policy structure for a Markov decision process representation of this problem. They prove that the optimal acquisition decision depends on the system congestion level — the total remanufacturing load weighted by the quality levels. Their results show that it becomes less desirable to acquire a used item as the number of available items or the quality level of any available item increases. To prove their results, the authors introduce a new functional characterization that is a relaxation of supermodularity and discrete convexity.


  • Open Access

    Optimal Scheduling in the Multiserver-job Model under Heavy Traffic

    by Isaac Grosof, Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf

    Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Essentially all of the theoretical work on multiserver-job systems focuses on maximizing utilization, with almost nothing known about mean response time. Our goal in this paper is to minimize mean response time in a multiserver-job setting. Minimizing mean response time requires prioritizing small jobs while simultaneously maximizing utilization. Our question is how to achieve these joint objectives. We devise the ServerFilling-SRPT scheduling policy, which is the first policy to minimize mean response time in the multiserver-job model in the heavy traffic limit. In addition to proving this heavy-traffic result, we present empirical evidence that ServerFilling-SRPT outperforms all existing scheduling policies for all loads, with orders of magnitude improvements at high load. Because ServerFilling-SRPT requires knowing job sizes, we also define the ServerFilling-Gittins policy, which is optimal when sizes are unknown or partially known. For more detail, see the full paper https://doi.org/10.1145/3570612