An optimal control problem for a modified M/G/k queueing system

Mario Lefebvre

Paper (2023)

Access this document
Available
Open access to the full text in PolyPublie and at the publisher's website
Published Version
Text Text • 367kB •

Abstract

Assume that in the M=G=k queueing model, it is possible to choose the number of servers who are working at the beginning of any service period. Suppose that the system starts at time t0 and that there are then k + l customers waiting for service. We want to determine the optimal number of servers that should be used to reduce the total number of customers to k + r, where 0 � r < l, taking the control costs into account. The particular case when the service time is deterministic is treated.

Uncontrolled Keywords

Funders:
NSERC
ISBN:
9789975684927
Conference Title:
Workshop on Intelligent Information Systems (WIIS 2023)
Conference Location:
Chisinau, Republic of Moldova
Conference Date(s):
2023-10-19 - 2023-10-21
Publisher:
Valnex
OAI:
oai:publications.polymtl.ca:57196
ORCID
Date Deposited:
29 Jan 2024 14:38
Last Modified:
13 Oct 2026 15:03
Cite in APA 7:
Lefebvre, M. (2023, October). An optimal control problem for a modified M/G/k queueing system [Paper]. Workshop on Intelligent Information Systems (WIIS 2023), Chisinau, Republic of Moldova. https://ibn.idsi.md/vizualizare_articol/192233

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only

View Item
View Item