Optimal policy for controlling two-server queueing systems with jockeying
Optimal policy for controlling two-server queueing systems with jockeying作者机构:School of BusinessJiangsu Normal UniversityXuzhou 221116China Wenzheng CollegeSoochow UniversitySuzhou 215104China Nanyang Business SchoolNanyang Technological UniversityNanyang 639798Singapore
出 版 物:《Journal of Systems Engineering and Electronics》 (系统工程与电子技术(英文版))
年 卷 期:2022年第33卷第1期
页 面:144-155页
核心收录:
学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 07[理学] 070105[理学-运筹学与控制论] 0802[工学-机械工程] 0811[工学-控制科学与工程] 0701[理学-数学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:supported by the National Social Science Fund of China (19BGL100)
主 题:queueing system jockeying optimal policy Markov decision process(MDP) dynamic programming
摘 要:This paper studies the optimal policy for joint control of admission, routing, service, and jockeying in a queueing system consisting of two exponential servers in *** arrive according to a Poisson *** each arrival, an admission/routing decision is made, and the accepted job is routed to one of the two servers with each being associated with a *** each service completion, the servers have an option of serving a job from its own queue, serving a jockeying job from another queue, or staying *** system performance is inclusive of the revenues from accepted jobs, the costs of holding jobs in queues, the service costs and the job jockeying *** maximize the total expected discounted return, we formulate a Markov decision process(MDP) model for this *** value iteration method is employed to characterize the optimal policy as a hedging point *** studies verify the structure of the hedging point policy which is convenient for implementing control actions in practice.