需求驱动流量队列的最优控制

IF 0.9 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2024-12-04 DOI:10.1016/j.orl.2024.107220

Guergana P. Ilieva, Hayriye Ayhan

{"title":"需求驱动流量队列的最优控制","authors":"Guergana P. Ilieva, Hayriye Ayhan","doi":"10.1016/j.orl.2024.107220","DOIUrl":null,"url":null,"abstract":"<div><div>We consider a Markovian queueing system with finite buffer space. Arriving customers belong to different classes and have class dependent service rates. At the time of an arrival, if the system is full, one of the existing customers has to be discharged prematurely, incurring a class dependent cost, whereas class dependent rewards are earned upon successful service completions. Our objective is to determine which customer class to discharge prematurely in order to maximize the long-run average profit.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"59 ","pages":"Article 107220"},"PeriodicalIF":0.9000,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal control of queues with demand-driven discharge\",\"authors\":\"Guergana P. Ilieva, Hayriye Ayhan\",\"doi\":\"10.1016/j.orl.2024.107220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We consider a Markovian queueing system with finite buffer space. Arriving customers belong to different classes and have class dependent service rates. At the time of an arrival, if the system is full, one of the existing customers has to be discharged prematurely, incurring a class dependent cost, whereas class dependent rewards are earned upon successful service completions. Our objective is to determine which customer class to discharge prematurely in order to maximize the long-run average profit.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"59 \",\"pages\":\"Article 107220\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637724001561\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724001561","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

考虑具有有限缓冲空间的马尔可夫排队系统。到达的顾客属于不同的等级，并且有不同等级的服务率。在到达时，如果系统已满，则必须提前释放一个现有客户，从而产生与类别相关的成本，而在成功完成服务时获得与类别相关的奖励。我们的目标是确定哪些客户类别应该提前退出，以最大化长期平均利润。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal control of queues with demand-driven discharge

We consider a Markovian queueing system with finite buffer space. Arriving customers belong to different classes and have class dependent service rates. At the time of an arrival, if the system is full, one of the existing customers has to be discharged prematurely, incurring a class dependent cost, whereas class dependent rewards are earned upon successful service completions. Our objective is to determine which customer class to discharge prematurely in order to maximize the long-run average profit.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.