敏捷供应链静态调度模型及其贪婪算法

Static scheduling model and its greedy algorithm of agile supply chain

针对确定性市场需求下的敏捷供应链(ASC)调度具有批量和时间双重约束的问题,根据供应层级关系建立多级供应链结构模型(SCSM),在此基础上设计调度问题的线性规划(LP)模型及其两阶段求解算法:第一阶段的最短响应时间调度贪婪算法判定供应链系统对需求批量和时间约束满足与否;第二阶段的精益调度贪婪算法求解以最小化供应链库存成本为目标的最优调度方案。最后通过算例验证了模型和算法的实用性和有效性。

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.