Optimal multi-server stochastic scheduling of two interconnected priority queues

D. G. Pandelis, D. Teneketzis
{"title":"Optimal multi-server stochastic scheduling of two interconnected priority queues","authors":"D. G. Pandelis, D. Teneketzis","doi":"10.1109/CDC.1993.325692","DOIUrl":null,"url":null,"abstract":"Summary form only given, as follows. A number of jobs on two interconnected queues are to be processed by m identical servers. The servers operate in parallel, so that every server can process any job. Jobs in queue i, i=1,2, incur an instantaneous holding cost C/sub i/ during the time they remain in the system. The service time for jobs in queue i, denoted by X/sub i/, is a random variable with a general distribution. The interconnection process is independent of the service process. We establish sufficient conditions on the service times, the holding costs and the interconnection process under which the nonpreemptive scheduling strategy that gives priority to queue 1 minimizes the total expected /spl alpha/-discounted cost. We call this strategy P/sub i/. We present counterexamples showing that if any of the sufficient conditions is not satisfied P/sub 1/ may not be optimal, and that the optimal policy for the single-server problem is not necessarily optimal for the multiserver problem.<<ETX>>","PeriodicalId":147749,"journal":{"name":"Proceedings of 32nd IEEE Conference on Decision and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 32nd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1993.325692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Summary form only given, as follows. A number of jobs on two interconnected queues are to be processed by m identical servers. The servers operate in parallel, so that every server can process any job. Jobs in queue i, i=1,2, incur an instantaneous holding cost C/sub i/ during the time they remain in the system. The service time for jobs in queue i, denoted by X/sub i/, is a random variable with a general distribution. The interconnection process is independent of the service process. We establish sufficient conditions on the service times, the holding costs and the interconnection process under which the nonpreemptive scheduling strategy that gives priority to queue 1 minimizes the total expected /spl alpha/-discounted cost. We call this strategy P/sub i/. We present counterexamples showing that if any of the sufficient conditions is not satisfied P/sub 1/ may not be optimal, and that the optimal policy for the single-server problem is not necessarily optimal for the multiserver problem.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
两个互连优先级队列的最优多服务器随机调度
仅给出摘要形式,如下。两个相互连接的队列上的许多作业将由m台相同的服务器处理。服务器并行运行,因此每个服务器都可以处理任何作业。队列i (i=1,2)中的作业在其停留在系统中的时间内会产生瞬时保持成本C/sub i/。队列i中作业的服务时间,用X/下标i/表示,是一个具有一般分布的随机变量。对接进程独立于业务进程。建立了服务时间、保持成本和互联过程的充分条件,在此条件下,优先考虑队列1的非抢占调度策略使总期望/ α /贴现成本最小。我们称之为P/ i/策略。我们给出的反例表明,如果任何一个充分条件不满足,P/sub 1/可能不是最优的,并且单服务器问题的最优策略不一定是多服务器问题的最优策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Approximate decoupling and asymptotic tracking for MIMO systems LMS is H/sup /spl infin// optimal Detection of limit cycles in discrete systems with backlash and resolution Approximate linearization of nonlinear control systems Algebraic criteria for absolute stability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1