Queuing dynamics in a system with impatient agents
Abstract
We investigate the dynamics of a First-Come-First-Served (FCFS) queuing system with impatient jockeying agents. We identify the global effects that the jockeying behavior presents in the system. The performance of the agents are studied by computing their average completion time and are examined with varying number of servers, system utilization, probability to jockey, and density of jockeying agents. The relative performances of the jockeying and non-jockeying agents are compared with the computed average completion time of agents in the same system without jockeying agents. It is found out that in all cases, jockeying is beneficial, if not for the jockeying agents themselves, for the non-jockeying agents. In general, jockeying betters the performance of the queuing agents and caters a more efficient utilization of the system.