We consider a single-server vacation queueing system that operates in the following manner. When the server returns from a vacation it observes the following rule. If there is at least one customer in the system, the server commences service and serves exhaustively before taking another vacation. If the server finds the system empty, it waits a fixed time c. At the expiration of this time the server commences another vacation if no customer has arrived; otherwise, it serves exhaustively before commencing another vacation. Analytical results are derived for the mean waiting time in the system. The timeout scheme is shown to be a generalized scheme of which both the single vacation and multiple vacations schemes are special cases, with c = ∞ and c = 0 respectively. The model is extended to the N-policy vacation queueing system. In both schemes we use a linear cost model to obtain an optimal operating value of c.
展开▼
