Static Scheduling Model and Algorithms of Agile Supply Chain Under Definite Demands

In this paper we study the static scheduling problems of definite market demands with time constraints in agile supply chains, which consist of multi-stage members with limited capacities. We establish a framework model to picture the supply chain´s structure and an integer nonlinear programming (INLP) model to describe the scheduling problem. Then we design a two-step algorithm with lower complexity to resolve the INLP model. 1) the shortest response time scheduling algorithm to judge whether the supply chain can meet the demands´ time constraints, 2) the lean scheduling algorithm to abtain the minimum inventory cost of the supply chain. Finally, we verify the practicality and effectiveness of the model and algorithms by a numeric experiment.