We consider optimal pricing for a two-station tandem queueing system with finite buffers and price-sensitive customers. The service provider quotes prices to customers using either static or dynamic pricing. The objective is to maximize either the infinite-horizon discounted profit or the...

For a system of finite queues, we study how servers should be assigned dynamically to stations in order to obtain optimal (or near-optimal) long-run average throughput. We assume that travel times between different service facilities are negligible, that each server can work on only one job at a...