Consider a revenue-maximizing provider who holds inventories for multiple components and adopts mix-bundling to sell a line of products made up of individual components and bundles that comprise these components. Consumers arrive over a finite time horizon up to the time of consumption and each...

We study a resource-sharing network where each job requires the concurrent occupancy of a subset of links (servers/resources), and each link's capacity is shared among job classes that require its service. The real-time allocation of the service capacity among job classes is determined by the...

We study a system with heterogeneous parallel servers, each with an infinite waiting room. Upon arrival, a job is routed to the queue of one of the servers. The objective is to find the routing policy that best utilizes the available state information to minimize the expected stationary queue...

Stochastic processing networks (SPN) are, in general, difficult objects to study analytically. The diffusion approximation refers to using the stationary distribution of the diffusion limit as an approximation of the diffusion-scaled process (say, the workload) in the original SPN. To validate...