On a single-server queue with multiple transaction
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 16 (1) , 125-136
- https://doi.org/10.1080/02331938508842998
Abstract
An algorithm is presented to determine time-dependent as well as several stationary queue length characteristics for single-server queues, in which the service transaction can consist of two components: the normal service time and the post-service time, In particular, a component wise non-preemptive priority discipline is considered, where the customers waiting for receiving their normal service time are preferred in face of the customers waiting for receiving their post-service time. The stationary characteristics of the total number of customers are obtained by solving a system of relationships between them where only one fixed stationary characteristic must be calculated explicitly.Keywords
This publication has 7 references indexed in Scilit:
- Stationary queue-length characteristics in queues with delayed feedbackJournal of Applied Probability, 1985
- Handbuch der Bedienungstheorie IIPublished by Walter de Gruyter GmbH ,1984
- Stationary queue-length and waiting-time distributions in single-server feedback queuesAdvances in Applied Probability, 1984
- RELATIONSHIPS BETWEEN TIME/CUSTOMER STATIONARY CHARACTERISTICS OF TANDEM QUEUES ATTENDED BY A SINGLE SERVERJournal of the Operations Research Society of Japan, 1984
- Handbuch der Bedienungstheorie IPublished by Walter de Gruyter GmbH ,1983
- Generalized regenerative processes with embedded regeneration periods and their applicationMathematische Operationsforschung und Statistik. Series Optimization, 1981
- Two Queues in Tandem Attended by a Single ServerOperations Research, 1977