Abstract
This paper studies a single-server queueing system in which no customer has to wait for a duration longer than a constant K. If the waiting time is longer than K, then the service time of the previous customer will have to be cut short. Using analytical method together with the property that the queueing process ‘starts anew’ probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary solutions for the system.