AbstractThis paper considers the problem of allocating resources among various locations in an information system where phases of a process are carried out. The approach taken combines queueing theory and dynamic programming. As an illustration of this approach, two prototype problems are considered in some detail: the distribution of computer terminals among various functions requiring access to a computer, and the distribution of personnel among the various phases of the process of cataloging a book. The technique is found to be both efficient and flexible.