关键词: 敏捷供应链, 线性规划, 最短响应时间调度, 精益调度, 贪婪算法

Abstract: In order to solve the scheduling problems of definite market demands with quantity and time constraints in Agile Supply Chain (ASC), which consists of multi-stage members with limited capacities, a Supply Chain Structure Model (SCSM) was firstly established according to the supplying distances between suppliers and the market. Then on the basis of SCSM, a Linear Programming (LP) model was set up to describe the scheduling problem, and a two-stage algorithm was developed to resolve the LP model. The shortest response time scheduling greedy algorithm in the first stage judged whether the supply chain could meet the demands' quantity and time constraints, and the lean scheduling greedy algorithm in the second stage obtained the supply chain's optimal scheduling solution with the minimum inventory cost. The practicality and effectiveness of the model and algorithms were verified by a scheduling example.

Key words: Agile Supply Chain (ASC), Linear Programming (LP), shortest response time scheduling, lean Scheduling, greedy algorithm