The paper considers a single-server queuing system in which a customer does not wait more than a fixed time k, so that if he does not get his service within this time, he departs. Some results are obtained by applying the theory of storage.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.