Related papers: Managing Appointment Booking under Customer Choice…

Recent years have witnessed success of sequential modeling, generative recommender, and large language model for recommendation. Though the scaling law has been validated for sequential models, it showed inefficiency in computational…

Modern business models have enabled service systems to leverage a large pool of casual employees with flexible hours, paid based on piece rates, to fulfill on-demand work. These systems have been successfully implemented in sectors such as…

A classical problem in appointment scheduling, with applications in health care, concerns the determination of the patients' arrival times that minimize a cost function that is a weighted sum of mean waiting times and mean idle times. One…

Queuing systems with redundant requests have drawn great attention because of their promise to reduce the job completion time and variability. Despite a large body of work on the topic, we are still far from fully understanding the benefits…

The problem of mobile sequential recommendation is presented to suggest a route connecting some pick-up points for a taxi driver so that he/she is more likely to get passengers with less travel cost. Essentially, a key challenge of this…

The classic newsvendor model yields an optimal decision for a ``newsvendor'' selecting a quantity of inventory, under the assumption that the demand is drawn from a known distribution. Motivated by applications such as cloud provisioning…

Stochastic choice-based discrete planning is a broad class of decision-making problems characterized by a sequential decision-making process involving a planner and a group of customers. The firm or planner first decides a subset of options…

In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…

Sequential allocation is a simple and widely studied mechanism to allocate indivisible items in turns to agents according to a pre-specified picking sequence of agents. At each turn, the current agent in the picking sequence picks its most…

We consider a discrete-time system comprising a first-come-first-served queue, a non-preemptive server, and a stationary non-work-conserving scheduler. New tasks enter the queue according to a Bernoulli process with a pre-specified arrival…

We investigate the optimal pricing strategy in a service-providing framework, where customers can leave the system prior to service completion. In this setting, a price is quoted to an incoming customer based on the current number of…

Chemotherapy appointment scheduling is a challenging problem due to the uncertainty in pre-medication and infusion durations. In this paper, we formulate a two-stage stochastic mixed integer programming model for the chemotherapy…

User preference learning is generally a hard problem. Individual preferences are typically unknown even to users themselves, while the space of choices is infinite. Here we study user preference learning from information-theoretic…

Modeling user sequential behaviors has recently attracted increasing attention in the recommendation domain. Existing methods mostly assume coherent preference in the same sequence. However, user personalities are volatile and easily…

Capturing users' precise preferences is a fundamental problem in large-scale recommender system. Currently, item-based Collaborative Filtering (CF) methods are common matching approaches in industry. However, they are not effective to model…

Recommender systems are one of the most successful applications of machine learning and data science. They are successful in a wide variety of application domains, including e-commerce, media streaming content, email marketing, and…

In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic customer arrival and service times, we seek a policy for switching…

This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each…

Planning in public transportation is traditionally done in a sequential process: After the network design process, the lines and their frequencies are planned. When these are fixed, a timetable is determined and based on the timetable, the…

Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…