Static vs. dynamic priority rules for check processing in multiple dispatch-multiple branch banking

A cyclic service system is composed of K channels (queues) and a single cyclically roving server who typically takes a positive amount of time to switch between channels. Research has previously focused on evaluating and computing performance measures (notably, waiting times) of fixed template routing schemes under three main service disciplines, the exhaustive, gated and limited service regimes.In this paper, probabilistic results are derived that allow control strategies and optimal policies to be considered for the first time. By concentrating on a new objective function, we are able to derive rules of index form amenable for direct implementation to dynamically control the system at suitably defined decision epochs. These rules utilize current system information, are of an adaptive nature, and are shown to emanate from a general physical principle.

Download Full-text

Dynamic priority rules for cyclic-type queues

Advances in Applied Probability ◽

10.1017/s0001867800018620 ◽

1989 ◽

Vol 21 (02) ◽

pp. 432-450 ◽

Cited By ~ 6

Author(s):

Sid Browne ◽

Uri Yechiali

Keyword(s):

Control Strategies ◽

Current System ◽

Waiting Times ◽

Physical Principle ◽

Priority Rules ◽

Dynamic Priority ◽

Cyclic Service ◽

Cyclic Type ◽

General Physical ◽

Adaptive Nature

A cyclic service system is composed of K channels (queues) and a single cyclically roving server who typically takes a positive amount of time to switch between channels. Research has previously focused on evaluating and computing performance measures (notably, waiting times) of fixed template routing schemes under three main service disciplines, the exhaustive, gated and limited service regimes. In this paper, probabilistic results are derived that allow control strategies and optimal policies to be considered for the first time. By concentrating on a new objective function, we are able to derive rules of index form amenable for direct implementation to dynamically control the system at suitably defined decision epochs. These rules utilize current system information, are of an adaptive nature, and are shown to emanate from a general physical principle.

Download Full-text

Dynamic priority rules when polling with multiple parallel servers

Operations Research Letters ◽

10.1016/0167-6377(92)90096-l ◽

1992 ◽

Vol 12 (3) ◽

pp. 129-137 ◽

Cited By ~ 8

Author(s):

Sid Browne ◽

Gideon Weiss

Keyword(s):

Priority Rules ◽

Dynamic Priority ◽

Parallel Servers

Download Full-text

From Hard Money to Branch Banking

California History ◽

10.1525/ch.2016.93.1.26 ◽

2016 ◽

Vol 93 (1) ◽

pp. 26-44

Author(s):

Larry Schweikart ◽

Lynne Pierson Doti

Keyword(s):

West Coast ◽

Financial Sector ◽

Gold Rush ◽

Test Case ◽

The West ◽

Branch Banking

In Gold Rush–era California, banking and the financial sector evolved in often distinctive ways because of the Gold Rush economy. More importantly, the abundance of gold on the West Coast provided an interesting test case for some of the critical economic arguments of the day, especially for those deriving from the descending—but still powerful—positions of the “hard money” Jacksonians.

Download Full-text