Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-15T13:25:32.908Z Has data issue: false hasContentIssue false
  • English
  • Français

The Design of a Cash Concentration System

Published online by Cambridge University Press:  06 April 2009

Bernell K. Stone  and
Ned C. Hill
Get access Rights & Permissions [Opens in a new window]

Extract

Cash concentration is the task of moving funds from depository banks into the central cash pool. It is useful to structure cash concentration by dividing it into two major problems––management and design. Management is the day-to-day operation of the cash concentration system once it is designed. Design is specifying the structure of the cash concentration system.

Type
Research Article
Information
Journal of Financial and Quantitative Analysis , Volume 16 , Issue 3 , September 1981 , pp. 301 - 322
Copyright
Copyright © School of Business Administration, University of Washington 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Baker, Kenneth R.; Maier, Steven F.; and Weide, James H. Vander. “Heuristic Methods for Solving the Lock-Box Location Problem and Related Location-Allocation Problems.” Working Paper, Graduate School of Business Administration, Duke University (09 1975).Google Scholar
[2]Bierce, Andrea H. “Retail Cash Management at J. C. Penney, Inc.” Journal of Cash Management, Vol. 1 (08 1980).Google Scholar
[3]Bulfin, R. L., and Unger, V. E.. “Computational Experience with an Algorithm for the Lock-Box Problem.” Proceedings of the National Association of Computing Machinery, 28th National Conference, Atlanta (08 1973), pp. 16–19.Google Scholar
[4]Corneugols, Gerard; Fisher, Marshall L.; and Nemhauser, George L.. “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.” Management Science, Vol. 23 (04 1977).Google Scholar
[5]Dantzig, George B., and Wolfe, Philip. “Decomposition Principle for Linear Programs.” Operations Research, Vol. 8 (1960), pp. 101–111.CrossRefGoogle Scholar
[6]Dantzig, George B., and Wolfe, Philip “The Decomposition Algorithm for Linear Programming.” Econometrica, Vol. 29 (10 1961), pp. 767–778.CrossRefGoogle Scholar
[7]Dantzig, George B.Linear Programming and Extensions, Chapter 23, “A Decomposition Principle for Linear Programs.” Princeton: Princeton University Press (1963).Google Scholar
[8]Fielitz, Bruce D., and White, Daniel L.. “A Two-Stage Solution Procedure for the Lock-Box Location Problem.” Management Science (forthcoming).Google Scholar
[9]Fielitz, Bruce D., and White, Daniel L.. “An Evaluation and Linking of Alternative Solutions Procedures for the Lock-Box Location Problem.” Working paper, Georgia State University (01 1979).Google Scholar
[10]Gitman, Lawrence J.; Forrester, D. Keith; and Forrester, John R. Jr “Maximizing Cash Disbursement Float.” Financial Management, Vol. 5 (Summer 1976), pp. 15–24.CrossRefGoogle Scholar
[11]Hillier, Frederick S., and Lieberman, Gerald J.. Introduction to Operations Research, 2nd ed., Chapter 16, “Algorithms for Linear Programming.” San Francisco: Holden-Day (1974).Google Scholar
[12]Khumawala, B. M. “An Efficient Branch-and-Bound Algorithm for the Warehouse Location Problem.” Management Science, Vol. 18 (1972), pp. B718–B732.CrossRefGoogle Scholar
[13]Maier, Steven F., and Weide, James H. Vander. “The Lock-Box Location Problem: A Practical Reformulation.” Journal of Bank Research, Vol. 5 (Summer 1974), pp. 166–172.Google Scholar
[14]Maier, Steven F., and Weide, James H. Vander. “A Unified Location Model for Cash Disbursements and Lock-Box Collections.” Journal of Bank Research, Vol. 7 (Summer 1976), pp. 166–172.Google Scholar
[15]Nauss, R. M., and Markland, R. E.. “Real World Experience with an Optimal Lock-Box Location Algorithm.” Working paper presented at the TIMS/ORSA Joint National Meeting, San Francisco (05 1977), forthcoming in Management Science.Google Scholar
[16]Spielburg, Kurt. “Algorithms for the Simple Plant-Location Problems with Some Side Conditions.” Operations Research, Vol. 17 (1969), pp. 85–111.CrossRefGoogle Scholar
[17]Stone, Bernell K. “Lock-Box Selection and Collection System Design: Objective Function Validity.” Journal of Bank Research, Vol. 10 (Winter 1980), pp. 251–254.Google Scholar
[18]Stone, Bernell K. “Design of a Receivable Collection System: Sequential Building Heuristics.” Management Science (forthcoming).Google Scholar
[19]Stone, Bernell K. “Zero-Balance Banking and Collection System Design in a Divisionalized Firm.” Working paper No. MS–79–2, College of Management, Georgia Institute of Technology (01 1979).Google Scholar
[20]Stone, Bernell K.; Ferguson, Daniel M.; and Hill, Ned C.. “Cash Transfer Scheduling: Overview.” The Cash Manager, Vol. 3 (03 1980), pp. 3–8.Google Scholar
[21]Stone, Bernell K., and Hill, Ned C.. “Cash Transfer Scheduling and Efficient Cash Concentration.” Financial Management, Vol. 10 (09 1980), pp. 35–43.CrossRefGoogle Scholar
[22]Stone, Bernell K., and Hill, Ned C.. “The Evaluation of Alternative Cash Transfer Mechanisms and Methods.” Journal of Bank Research (forthcoming).Google Scholar