Premium
A DYNAMIC PROGRAMMING MODEL FOR OPTIMAL ALLOCATION OF DECISION TIME
Author(s) -
Shrode William A.
Publication year - 1973
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1973.tb01707.x
Subject(s) - computer science , optimal decision , decision model , decision process , dynamic programming , decision analysis , limiting , operations research , process (computing) , set (abstract data type) , decision rule , mathematical optimization , decision field theory , decision engineering , business decision mapping , decision support system , management science , decision tree , artificial intelligence , machine learning , mathematics , economics , statistics , algorithm , engineering , mechanical engineering , programming language , operating system
Recurrent decision making by a lower‐level manager can be viewed as a sequential decision process in which time and uncertainty are limiting factors. Under these conditions, the manager must determine how to best utilize his decision making time consistent with his own particular set of decision values. A dynamic programming model was devised to determine the optimal (consistent) allocation of decision time among five different types of problems for a sequence of simulated recurrent decision situations. Fifty‐one lower‐level managers were interviewed about their use of decision time and decision procedures. The model was validated by comparing model assumptions and results with the findings from the interviews. The model was used to determine the effects of variations in the levels of time available and uncertainty upon the optimal allocation of decision time.