We consider a dynamic control problem for a parallel server system commonly known as the N-system. An N-system is a two-server parallel server system with two job classes, one server that can serve both classes, and one server that can only serve one class. We assume that jobs within each class...

In an assemble-to-order system, a wide variety of products are rapidly assembled from component inventories, in response to customer orders. Orders must be filled within a productspecific target leadtime. In the event that some of the components required to fill an order are out-of-stock, these...

We consider an assemble-to-order system with a high volume of prospective customers arriving per unit time. A companion paper established that with optimal product prices, component production capacity, and sequencing of orders for assembly, the system can be approximated by a diffusion process...

We consider an assemble-to-order system with a high volume of prospective customers arriving per unit time. Our objective is to maximize expected infinite horizon discounted profit by choosing product prices, component production capacities, and a dynamic policy for sequencing customer orders...

We consider an assemble-to-order system with a high volume of prospective customers arriving per unit time. Our objective is to maximize expected infinite horizon discounted profit by choosing product prices, component production capacities, and a dynamic policy for sequencing customer orders...

We consider an assemble-to-order system with a high volume of prospective customers arriving per unit time. A companion paper established that with optimal product prices, component production capacity, and sequencing of orders for assembly, the system can be approximated by a diffusion process...

Common wisdom suggests that, everything else being equal, seeing patients sooner rather than later is preferable. In particular, health outcomes improve with reduced delay and so does patient satisfaction. Meanwhile, if the delay in access to care is reduced, rescheduling becomes easier and thus...

We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (staffing) and how does one match them with customers (control) in order to minimize cost or maximize profit, subject...

We use sample path arguments to derive convexity properties of an M/M/S queue withimpatient customers that balk and renege. First, assuming that the balking probability andreneging rate are increasing and concave in the total number of customers in the system(head-count), we prove that the...

Although pooling queues offers in principle many operational benefits, these may not always be achieved in practice. One reason, observed in the empirical study by Song et al. (2015), relates to customer ownership. In this paper, we formalize these empirical observations by developing a...