Thumbnail Image
Item

Heavy-traffic universality of redundancy systems with assignment constraints

Cardinaels,Ellen
; 
Borst,Sem
; 
van Leeuwaarden,Johan S.H.
Abstract
Service systems often face task-server assignment constraints because of skill-based routing or geographical conditions. Redundancy scheduling responds to this limited flexibility by replicating tasks to specific servers in agreement with these assignment constraints. We gain insight from product-form stationary distributions and weak local stability conditions to establish a state space collapse in heavy traffic. In this limiting regime, the parallel-server system with redundancy scheduling operates as a multiclass single-server system, achieving full resource pooling and exhibiting strong insensitivity to the underlying assignment constraints. In particular, the performance of a fully flexible (unconstrained) system can be matched even with rather strict assignment constraints.
Description
Publisher Copyright: © 2022 INFORMS.
Date
2024-07
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
cardinaels-et-al-2022-heavy-traffic-universality-of-redundancy-systems-with-assignment-constraints.pdf
Adobe PDF, 1.03 MB
Research Projects
Organizational Units
Journal Issue
Keywords
assignment constraints, heavy-traffic limit, heterogeneity, load balancing, parallel-server systems, redundancy scheduling, resource pooling, state space collapse
Citation
Cardinaels, E, Borst, S & van Leeuwaarden, J S H 2024, 'Heavy-traffic universality of redundancy systems with assignment constraints', Operations Research, vol. 72, no. 4, pp. 1539-1555. https://doi.org/10.1287/opre.2022.2385
URI
https://hdl.handle.net/20.500.14602/78560
License
info:eu-repo/semantics/openAccess
cb
Embedded videos