On computing supply chain scheduling using max-plus Algebra

In this paper we discuss the problems of supply chain scheduling for the distribution of oil feedstock from a fuel terminal to another one using tankers transportation. We derive some algorithms of supply chain scheduling computational problems using max-plus algebra. The resulting algorithms are used in some cases of supply chain scheduling in order to obtain an optimal scheduling i.e., when the tankers must leave so that the arrival time of the tankers is appropriate to meet the customer demand.