Dynamic Control of Unreliable Flexible Servers: The 'W' Network and Beyond

Posted: 2 Jul 2013

See all articles by Soroush Saghafian

Soroush Saghafian

Harvard University - Harvard Kennedy School (HKS)

Bora Kolfal

University of Alberta - Department of Accounting, Operations & Information Systems

Mark P. Van Oyen

University of Michigan at Ann Arbor

Date Written: June 1, 2010

Abstract

Assigning partially flexible resources (servers) effectively to various jobs (customers or products) in real-time is a fundamental problem in many applications such as service centers, manufacturing systems, and communication networks. Although the potential benefits of using flexible servers to improve the performance of such systems is generally acknowledged, policies for controlling such networks in real-time to extract this potential benefit are not well understood. We address this problem in a general framework where servers are heterogeneous and also subject to stochastic disruptions. We consider the average holding cost as the performance criterion, and first analyze parallel queueing systems with general structures. To gain more insights, we then focus on a structure with two servers and three customer classes forming a "W." In this structure, servers are trained to serve a shared task in addition to their fixed (specialized) task. We find that the "W" design is highly ecient; it requires only a small amount of cross-training, but performs almost as well as a fully cross-trained system. We then show that (even allowing disruptions) a version of the cµ rule, which prioritizes serving the "fixed task before the shared," is optimal under some conditions. However, our results show that, in general, the optimal policy is complex, and not well-structured for implementation in practice. Hence, we propose a powerful and yet very simple policy to control the servers in parallel queueing systems. This new heuristic (which can be implemented in any parallel queueing system) eectively combines the intuition underlying two widely used policies: (1) the load balancing objective in serving the Longest Queue (LQ), and (2) the greedy cost minimization emphasis of the cµ rule. Our proposed control policy, termed as "LEWC," defines a simple and intuitive measure of workload costs and assigns each server to the queue with the Largest Expected Workload Cost (LEWC) among its skill set. Our extensive numerical tests show that the proposed policy performs well in comparison with three key policies: optimal, cµ and LQ. LEWC is also a very robust policy which makes it suitable for strategic design purposes.

Suggested Citation

Saghafian, Soroush and Kolfal, Bora and Van Oyen, Mark P., Dynamic Control of Unreliable Flexible Servers: The 'W' Network and Beyond (June 1, 2010). IIE Transitions 2011, University of Alberta School of Business Research Paper No. 2013-1051, Available at SSRN: https://ssrn.com/abstract=2279662

Soroush Saghafian (Contact Author)

Harvard University - Harvard Kennedy School (HKS) ( email )

79 John F. Kennedy Street
Cambridge, MA 02138
United States

Bora Kolfal

University of Alberta - Department of Accounting, Operations & Information Systems ( email )

Edmonton, Alberta T6G 2R6
Canada

Mark P. Van Oyen

University of Michigan at Ann Arbor ( email )

500 S. State Street
Ann Arbor, MI 48109
United States

Here is the Coronavirus
related research on SSRN

Paper statistics

Abstract Views
881
PlumX Metrics