A service system with on-demand agent invitations

被引:0
|
作者
Guodong Pang
Alexander L. Stolyar
机构
[1] Pennsylvania State University,Harold and Inge Marcus Department of Industrial and Manufacturing Engineering
[2] Lehigh University,Department of Industrial and Systems Engineering
来源
Queueing Systems | 2016年 / 82卷
关键词
Service systems; Call centers; Knowledge workers; On-demand agent invitation; Fluid and diffusion limits; Interchange of limits; 60K25; 60F17; 90B15;
D O I
暂无
中图分类号
学科分类号
摘要
We consider a service system where agents are invited on-demand. Customers arrive exogenously as a Poisson process and join a customer queue upon arrival if no agent is available. Agents decide to accept or decline invitations after some exponentially distributed random time, and join an agent queue upon invitation acceptance if no customer is waiting. A customer and an agent are matched in the order of customer arrival and agent invitation acceptance under the non-idling condition, and will leave the system simultaneously once matched (service times are irrelevant here). We consider a feedback-based adaptive agent invitation scheme, which controls the number of pending agent invitations, depending on the customer and/or agent queue lengths and their changes. The system process has two components— ‘the difference between agent and customer queues’ and ‘the number of pending invitations,’ and is a countable continuous-time Markov chain. For the case when the customer arrival rate is constant, we establish fluid and diffusion limits, in the asymptotic regime where the customer arrival rate goes to infinity, while the agent response rate is fixed. We prove the process stability and fluid-scale limit interchange, which in particular imply that both customer and agent waiting times in steady-state vanish in the asymptotic limit. To do this we develop a novel (multi-scale) Lyapunov drift argument; it is required because the process has non-trivial behavior on the state space boundary. When the customer arrival rate is time-varying, we present a fluid limit for the processes in the same asymptotic regime. Simulation experiments are conducted to show good performance of the invitation scheme and accuracy of fluid limit approximations.
引用
收藏
页码:259 / 283
页数:24
相关论文
共 50 条
  • [1] A service system with on-demand agent invitations
    Pang, Guodong
    Stolyar, Alexander L.
    QUEUEING SYSTEMS, 2016, 82 (3-4) : 259 - 283
  • [2] On-Demand Virtual System Service
    Taniuchi, Yasutaka
    FUJITSU SCIENTIFIC & TECHNICAL JOURNAL, 2010, 46 (04): : 420 - 426
  • [3] On-Demand Integration of Digital Service System
    Gou, Juanqiong
    Li, Xuewei
    Dai, Wei
    IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 2774 - +
  • [4] A Service System with Randomly Behaving On-demand Agents
    Nguyen, Lam M.
    Stolyar, Alexander L.
    SIGMETRICS/PERFORMANCE 2016: PROCEEDINGS OF THE SIGMETRICS/PERFORMANCE JOINT INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SCIENCE, 2016, : 365 - 366
  • [5] On-Demand Service Platforms
    Taylor, Terry A.
    M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2018, 20 (04) : 704 - 720
  • [6] Operations on an on-demand ride service system with express and limousine
    Wang, Jing-Peng
    Huang, Hai-Jun
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2022, 155 : 348 - 373
  • [7] Agent-based planning method for an on-demand transportation system
    Miyamoto, T
    Nakatyou, K
    Kumagai, S
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL, 2003, : 620 - 625
  • [8] DESIGNING AN ON-DEMAND MULTIMEDIA SERVICE
    RANGAN, PV
    VIN, HM
    RAMANATHAN, S
    IEEE COMMUNICATIONS MAGAZINE, 1992, 30 (07) : 56 - 64
  • [9] On-demand design service innovations
    Shimizu, S. (shimizus@jp.ibm.com), 1600, IBM Corporation (48): : 5 - 6
  • [10] On-demand design service innovations
    Shimizu, S
    Ishikawa, H
    Satoh, A
    Aihara, T
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 2004, 48 (5-6) : 751 - 765