<doi_batch xmlns="http://www.crossref.org/schema/4.4.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="4.4.0"><head><doi_batch_id>36e9b140-8d48-4238-a413-403da3532ba3</doi_batch_id><timestamp>20231027064354448</timestamp><depositor><depositor_name>wseas:wseas</depositor_name><email_address>mdt@crossref.org</email_address></depositor><registrant>MDT Deposit</registrant></head><body><journal><journal_metadata language="en"><full_title>WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL</full_title><issn media_type="electronic">2224-2856</issn><issn media_type="print">1991-8763</issn><archive_locations><archive name="Portico"/></archive_locations><doi_data><doi>10.37394/23203</doi><resource>http://wseas.org/wseas/cms.action?id=4073</resource></doi_data></journal_metadata><journal_issue><publication_date media_type="online"><month>1</month><day>2</day><year>2023</year></publication_date><publication_date media_type="print"><month>1</month><day>2</day><year>2023</year></publication_date><journal_volume><volume>18</volume><doi_data><doi>10.37394/23203.2023.18</doi><resource>https://wseas.com/journals/sac/2023.php</resource></doi_data></journal_volume></journal_issue><journal_article language="en"><titles><title>Reducing the Size of a Waiting Line Optimally</title></titles><contributors><person_name sequence="first" contributor_role="author"><given_name>Mario</given_name><surname>Lefebvre</surname><affiliation>Department of Mathematics and Industrial Engineering Polytechnique Montréal 2500, chemin de Polytechnique, Montréal (Québec) H3T 1J4 CANADA</affiliation></person_name></contributors><jats:abstract xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1"><jats:p>The problem of reducing the number of customers waiting for service in a modifiedM/G/k queueing model is considered. We assume that the optimizer can decide how many servers are working at any time instant. The optimization problem ends as soon as the objective has been achieved or a time limit has been reached. Cases when dynamic programming can be used to determine the optimal control even if the service time is not exponentially distributed are presented.</jats:p></jats:abstract><publication_date media_type="online"><month>10</month><day>27</day><year>2023</year></publication_date><publication_date media_type="print"><month>10</month><day>27</day><year>2023</year></publication_date><pages><first_page>342</first_page><last_page>345</last_page></pages><publisher_item><item_number item_number_type="article_number">35</item_number></publisher_item><ai:program xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" name="AccessIndicators"><ai:free_to_read start_date="2023-10-27"/><ai:license_ref applies_to="am" start_date="2023-10-27">https://wseas.com/journals/sac/2023/a705103-017(2023).pdf</ai:license_ref></ai:program><archive_locations><archive name="Portico"/></archive_locations><doi_data><doi>10.37394/23203.2023.18.35</doi><resource>https://wseas.com/journals/sac/2023/a705103-017(2023).pdf</resource></doi_data><citation_list><citation key="ref0"><unstructured_citation>M. Lefebvre and R. Yaghoubi. Optimal control of a queueing system. (Submitted for publication) </unstructured_citation></citation><citation key="ref1"><unstructured_citation>P. Whittle. Optimization over Time, Vol. I, Wiley, Chichester, 1982. </unstructured_citation></citation><citation key="ref2"><unstructured_citation>P. Whittle. Risk-sensitive Optimal Control, Wiley, Chichester, 1990. </unstructured_citation></citation><citation key="ref3"><doi>10.1080/00207721.2022.2083258</doi><unstructured_citation>M. Lefebvre and P. Pazhoheshfar. An optimal control problem for the maintenance of a machine. International Journal of Systems Science, vol. 53, no. 15, 2022, pp. 3364–3373. https://doi.org/10.1080/00207721.2022.20832- 58 </unstructured_citation></citation><citation key="ref4"><doi>10.2307/3213947</doi><unstructured_citation>J. Kuhn. The risk-sensitive homing problem. Journal of Applied Probability, vol. 22, 1985, pp. 796–803. https://doi.org/10.2307/3213947 </unstructured_citation></citation><citation key="ref5"><doi>10.1016/j.automatica.2009.06.015</doi><unstructured_citation>C. Makasu. Risk-sensitive control for a class of homing problems. Automatica, vol. 45, no. 10, 2009, pp. 2454–2455. https://doi.org/10.1016/- j.automatica.2009.06.015 </unstructured_citation></citation><citation key="ref6"><doi>10.1007/s11009-020-09800-2</doi><unstructured_citation>M. Kounta and N.J. Dawson. Linear quadratic Gaussian homing for Markov processes with regime switching and applications to controlled population growth/decay. Methodology and Computing in Applied Probability, vol. 23, 2021, pp. 1155–1172. https://doi.org/10.1007/s11009-020-09800-2 </unstructured_citation></citation><citation key="ref7"><unstructured_citation>M. Lefebvre. An optimal control problem for a modified M/G/k queueing system. Proceedings of the Workshop on Intelligent Information Systems (WIIS2023), October 2023, Chişinǎu, Republic of Moldova, 8 pages. </unstructured_citation></citation><citation key="ref8"><doi>10.1007/s40305-022-00413-9</doi><unstructured_citation>L. Luo, Y.-H. Tang, M.-M. Yu and W.-Q. Wu. Optimal control policy of M/G/1 queueing system with delayed randomized multiple vacations under the modified min(N, D)-policy control. Journal of the Operations Research Society of China, 2022. https://doi.org/10.1007/s40305- 022-00413-9 </unstructured_citation></citation><citation key="ref9"><doi>10.1016/j.engappai.2022.105683</doi><unstructured_citation>A. Petrović, M. Nikolić, U. Bugarić, B. Delibašić and P. Lio. Controlling highway toll stations using deep learning, queuing theory, and differential evolution. Applications of Artificial Intelligence, vol. 119, 2023, 105683. https://doi.org/10.1016/j.engappai.2022.105683 </unstructured_citation></citation><citation key="ref10"><doi>10.1145/3570619</doi><unstructured_citation>F. Xinzhe and N. Modiano. Joint learning and control in stochastic queueing networks with unknown utilities. Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol. 6, no. 3, 2022, Article 58, 32 pages. https://doi.org/10.1145/3570619</unstructured_citation></citation></citation_list></journal_article></journal></body></doi_batch>