| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143419 | Operations Research Letters | 2006 | 5 Pages |
Abstract
We prove a lower bound on the optimal price for a fairly large class of blocking systems with general arrival and service processes, determine optimal price expressions for M/M/1/m and M/GI/s/s systems, and investigate how optimal prices change with changes in the size of the waiting room and service capacity.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Serhan Ziya, Hayriye Ayhan, Robert D. Foley,