Search

This paper offers a heuristic algorithm for the allocation of resources both in physical space and in time. The algorithm, to be implemented by a computer, will seek out good, if not optimum, combinations of items, namely, schedules and arrangements with respect to more than one payoff function. The algorithm has application in such diverse fields as the time scheduling budget allocations, courses of study in training programs, transportation, interdependent projects, and allocation in two or three dimensional space of production, service and/or warehousing facilities. [ABSTRACT FROM AUTHOR]

It is generally recognized that reinforcement, over an extended period of time of a given subject matter taught, enhances the student's mastery and subsequent retention of knowledge and/or skills. Recent major studies of curricula have concentrated on the content and method of presentation but have not made any significant strides towards the systematic exploitation of the potential contribution to the learning process of reinforcement through proper sequencing of subject matter presentation. This paper outlines a mathematical model of the established and industrially validated learning and forgetting theories and presents a computer executed heuristic algorithm for the selection of the best schedule for subject presentation. Applications of this methodology can be made at all levels of our educational system; from the elementary grades through graduate school, in highly academic as well as vocational training programs. [ABSTRACT FROM AUTHOR]