AbstractThis paper discusses the well-known problems ofmcandidates andnpositions usually called term assignment problems. The paper considers these problems when decisions for short and long term policies must be taken and also in extreme situations, such as emergency cases. Assignment and Knapsack problems, Heirarchy Analysis, Graphs Theory and Metric Spaces using Dynamic Programming are used on a computer.