Accession Number:

AD0673891

Title:

OPTIMAL TIME ALLOCATION IN COMPLEX TASKS,

Descriptive Note:

Corporate Author:

POLYTECHNIC INST OF BROOKLYN N Y DEPT OF ELECTRICAL ENGINEERING

Personal Author(s):

Report Date:

1968-06-01

Pagination or Media Count:

236.0

Abstract:

The thesis studies the problem-solving situation from an input-output point of view, with emphasis on the following two aspects. First, the expected payoff is related to the time spent analyzing the various components of the problem. Second, the optimal allocation of a finite amount of time among m independent problems is derived in terms of the complexities of the problems, and the correlation between each problem and the problem solvers ability and experience. By alluding to the stochastic theory of learning it is shown that, in general, the expected payoff in a problem-solving situation is a concave function of time satisfying four conditions. Justifications are given for the approximation of the payoff by an exponential function of time. The theory of hypothesis testing in the presence of white Gaussian noise is also used to verify these assumptions about the functional form of the expected payoff. Author

Subject Categories:

  • Administration and Management
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE