Aplicação para definir escalonamento de compras de vacinas, usando programação dinâmica para reduzir custos financeiros

Abstract

A dynamic programming technique to calculate the lowest costing scheduling for vaccine purchase and storage, was studied. When utilizing this technique, it is possible to guarantee the optimal solution to determine the dates of purchase of vaccines in any clinic or hospital. In this paper, it was also demonstrated the backtracking recursive technique and how inferior it is computationally in this situation. The objective of the situation problem is not only to create a situational algorithm but also a generic one that can be used in more diverse situations and time intervals, without any loss of the many benefits of the dynamic programming technique. Due to the generalization of the algorythm, a solution with configurable input data was created.