We study a dynamic assortment selection problem where arriving customers make purchase decisions among offered products from a universe of $N$ products under a Markov-chain-based choice (MCBC) model. The retailer observes only the assortment and the customer's single choice per period. Given...

We study the question of scheduling impatient customers in parallel server queuing systems. At the time of arrival, customers can be identified as one of many classes, where the class represents the service time and patience time distributions, and cost characteristics. From the system's...