Modified value iteration for chemotherapy scheduling optimization

An optimization algorithm for chemotherapy scheduling study is developed in this paper. We consider the density of host and cancer cells of a patient as states, and define the optimal chemotherapy scheduling as the shortest treatment path that will cure the patient, if possible. Given the fact that the treatment time is always interger-valued in our model, we used a modified version of the value iteration algorithm originally designed for Markov Decision Process. Simulation results and discussions are also given.