<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-01T02:44:26Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/50027" metadataPrefix="oai_dc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/50027</identifier><datestamp>2024-03-11T15:16:25Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Performance analysis and optimal control of the Geo/Geo/c queue</dc:title>
   <dc:creator>Artalejo Rodríguez, Jesús Manuel</dc:creator>
   <dc:creator>Hernández-Lerma, O.</dc:creator>
   <dc:subject>519.8</dc:subject>
   <dc:subject>Discrete queues</dc:subject>
   <dc:subject>Multiple servers</dc:subject>
   <dc:subject>Optimal control</dc:subject>
   <dc:subject>Steady-state distribution</dc:subject>
   <dc:subject>Investigación operativa (Matemáticas)</dc:subject>
   <dc:subject>1207 Investigación Operativa</dc:subject>
   <dc:description>The authors thank the referee for his comments on an earlier version of this paper. It was finished during
a visit of O. Hernández-Lerma to Madrid which was supported by the Secretaria General Técnica del Ministerio de Educación y Cultura. This research was also supported by the projects CONACyT 37355-E and PB98-0837.</dc:description>
   <dc:description>Discrete-time multiserver queues have been used for many years to investigate the behavior of communication and computer systems in which time is slotted. In this paper, we consider the discrete-time Geo/Geo/cqueue. We first develop an efficient recursive procedure to obtain the steady-state probabilities and prove the convergence to the continuous-time counterpart. We also deal with the infinite-horizon discounted cost criterion for the arrival and service rate control problems. Optimal stationary policies and value functions are determined. This allows us to compare both control problems.</dc:description>
   <dc:description>Secretaria General Técnica del Ministerio de Educación y Cultura</dc:description>
   <dc:description>Depto. de Estadística e Investigación Operativa</dc:description>
   <dc:description>Fac. de Ciencias Matemáticas</dc:description>
   <dc:description>TRUE</dc:description>
   <dc:description>pub</dc:description>
   <dc:date>2023-06-20T09:36:40Z</dc:date>
   <dc:date>2023-06-20T09:36:40Z</dc:date>
   <dc:date>2003-03</dc:date>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/50027</dc:identifier>
   <dc:identifier>0166-5316</dc:identifier>
   <dc:identifier>10.1016/S0166-5316(02)00161-X</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>CONACyT 37355-E</dc:relation>
   <dc:relation>PB98-0837</dc:relation>
   <dc:rights>restricted access</dc:rights>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Elsevier</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>