This paper studies multiple suppliers’ supply chain scheduling problem. A precise mathematical scheduling model is first built. Moreover, based on the optimal condition analysis, one problem related to the objectives of minimize the number of tardy jobs has been investigated. Furthermore, the corresponding dynamic programming method has been presented. These algorithm has been proved to be efficient by showing its pseudo-polynomial complexity.