• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.943-952
• /
• 1999

Models of single-server queues with vacation have been widely used to study the performance of many computer communica-tion and production system. In this paper we use the formula for a wide class of vacation policies and multiple types of vacations based on the M/G/1 queue with generalized vacations and exhaustive service. furthermore we derive the waiting times for many complex vacation policies which would otherwise be to analyze. These new results are also applicable to other related queueing models. if they conform with the basic model considered in this paper.