DYNAMIC PROGRAMMING ALGORITHM FOR CHECK SORTING.

Frederic H. Murphy, Edward A. Stohr

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

The paper characterizes the optimal strategy for sorting deposited checks, which is a major problem faced by banks, and describes an efficient procedure for finding the optimal solution for problems of the size generally found in practice. The algorithm is based on a two-state dynamic programming recursion in which characterization theorems are used to drastically reduce the size of the state space and in which the storage requirements are minimal. An analysis of computational experience is included and it is described how the algorithm can be used in a real time environment with deadlines.

Original languageEnglish
Pages (from-to)59-70
Number of pages12
JournalManagement Science
Volume24
Issue number1
DOIs
StatePublished - 1977

Fingerprint

Dive into the research topics of 'DYNAMIC PROGRAMMING ALGORITHM FOR CHECK SORTING.'. Together they form a unique fingerprint.

Cite this