2023/10/27 by Agniv Bandyopadhyay, Sandeep Juneja, Bandyopadhyay, Agniv +1
Business, Management and Accounting · Social Sciences · #Advanced Queuing Theory Analysis #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Performance (cs.PF) #Supply Chain and Inventory Management #Transportation Planning and Optimization
paper · pdf · doi:10.48550/arxiv.2310.18149
openalex publication_date 2023/10/27 · openalex created_date 2023/11/01 · openalex updated_date 2026/07/28
We consider a queuing network that opens at a specified time, where customers are non-atomic and belong to different classes. Each class has its own route, and as is typical in the literature, the costs are a linear function of waiting and service completion time. We restrict ourselves to a two class, two queue network: this simplification is well motivated as the diversity in solution structure as a function of problem parameters is substantial even in this simple setting (e.g., a specific routing structure involves eight different regimes), suggesting a combinatorial blow up as the number of queues, routes and customer classes increase. We identify the unique Nash equilibrium customer arrival profile when the customer linear cost preferences are different. This profile is a function of problem parameters including the size of each class, service rates at each queue, and customer cost preferences. When customer cost preferences match, under certain parametric settings, the equilibrium arrival profiles may not be unique and may lie in a convex set. We further make a surprising observation that in some parametric settings, customers in one class may arrive in disjoint intervals. Further, the two classes may arrive in contiguous intervals or in overlapping intervals, and at varying rates within an interval, depending upon the problem parameters.