We consider a learning variant of a canonical scheduling problem in a multiclass many server queue with abandonment (specifically, the M_t/M/N+M and the GI/GI/N+GI queues). The objective is to minimize the long-run average class-dependent expected linear holding and abandonment costs when the...

This paper investigates an optimal sequencing and dynamic pricing prob- lem for a two-class queueing system. Using a Markov Decision Process based model, we obtain structural characterizations of optimal policies. In particular, it is shown that the optimal pricing policy depends on the entire...

This article studies the optimal prices and service quality grades that a queuing system --- the "firm” --- provides to heterogeneous, utility-maximizing customers who measure quality by their experienced delay distributions. Results are threefold: First, delay cost curves are introduced that...

A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic...

Consider the following due-date scheduling problem in a multiclass, acyclic, single-station service system: any class k job arriving at time t must be served by its due date t D_{k}. Equivalently, its delay ¦Ó_{k} must not exceed a given delay or lead-time D_{k}. In a stochastic system the...

We study how multi-product queueing systems should be controlled so that sojourn times (or end-to-end delays) do not exceed specified leadtimes. The network dynamically decides when to admit new arrivals and how to sequence the jobs in the system. To analyze this difficult problem, we propose an...

In this Extended Appendix, we extend the mixed integer second-order cone programming (MISOCP) formulation as well as the heuristics derived in Mak et al. (2013) to tackle the problem of assigning and sequencing appointments for multiple servers. Numerical examples are provided to demonstrate the...

We developed a method for workforce scheduling that models both the structure of the set of permissible shifts, and the stochastic and time-varying demand process. A prototype implementation uses a genetic algorithm to search for good schedules, and evaluates the service level resulting from a...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...