Abstract: The single-item freight transportation and inventory scheduling problem with a time- varying demand and a convex cost function was investigated. To minimize farthest the total cost of transportation and inventory, the optimal transportation and inventory scheduling scheme must be arranged. For this reason, a graph algorithm to optimize transportation and inventory scheduling schemes was proposed. At last, the proposed algorithm was illustrated using an example. The result shows that the algorithm is feasible.