Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-08T02:30:37.481Z Has data issue: false hasContentIssue false
  • English
  • Français

A Globally Gated Polling System with Server Interruptions, and Applications to the Repairman Problem

Published online by Cambridge University Press:  27 July 2009

O. J. Boxma ,
J. A. Weststrate  and
U. Yechiali
O. J. Boxma
Affiliation:
Centre for Mathematics and Computer ScienceP.O. Box 4079, 1009 AB Amsterdam, The Netherlands*; Faculty of Economics, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands
J. A. Weststrate
Affiliation:
Faculty of Economics, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands
U. Yechiali
Affiliation:
Department of Statistics, School of Mathematical Sciences, The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

A repair crew is responsible for the maintenance and operation of N installations. The crew has to perform a collection of preventive maintenance tasks at the various installations. The installations may break down from time to time, generating corrective maintenance requests which have priority over the preventive maintenance tasks. We formulate and analyze this real-world problem as a single-server multi-queue polling model with Globally Gated service discipline and with server interruptions. We derive closed-form expressions for the Laplace-Stieltjes Transform and the first moment of the waiting time distributions of the preventive and corrective maintenance requests at the various installations, and obtain simple and easily implementable static and dynamic rules for optimal operation of the system. We further show that, for the socalled elevator-type polling scheme, mean waiting times of preventive maintenance jobs at all installations are equal.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 7 , Issue 2 , April 1993 , pp. 187 - 208
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Altman, E., Khamisy, A., & Yechiali, U. (1992). On elevator polling with globally gated regime. Queueing Systems, Special Issue on Polling Models 11 (85–90).CrossRefGoogle Scholar
2.Borst, S.C. (1993). CWI Report (in preparation).Google Scholar
3.Boxma, O.J. (1989). Workloads and waiting times in single-server queues with multiple customer classes. Queueing Systems 5: 185–214.CrossRefGoogle Scholar
4.Boxma, O.J., Levy, H., & Yechiali, U. (1992). Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Annals of Operations Research (35:487–208).CrossRefGoogle Scholar
5.Browne, S. & Yechiali, U. (1989). Dynamic priority rules for cyclic-type queues. Advances in Applied Probability 21: 432–450.CrossRefGoogle Scholar
6.Cohen, J.W. (1982). The single server queue, 2nd ed.Amsterdam: North-Holland.Google Scholar
7.Doshi, B.T. (1986). Queueing systems with vacations — A survey. Queueing Systems 1: 29–66.CrossRefGoogle Scholar
8.Gelenbe, E. & Mitrani, I. (1980). Analysis and synthesis of computer systems. New York: Academic Press.Google Scholar
9.Kella, O. & Yechiali, U. (1988). Priorities in M/G/1 queues with server vacations. Naval Research Logistics 35: 23–34.3.0.CO;2-B>CrossRefGoogle Scholar
10.Levy, Y. & Yechiali, U. (1975). Utilization of idle time in an M/G/1 queueing system. Management Science 22: 202–211.CrossRefGoogle Scholar