Abstract: In order to solve the insertion order scheduling problem of agile supply chains for production planning, a two stage supply chain composed of one factory and many suppliers was studied. Taking the minimization of the total supply chain cost as the objective, an Integer Planning (IP) model was designed to describe the scheduling problem based on the time slot representation of each firm's available scheduling periods, and an One-by-One Selection Heuristic (OOSH) algorithm was proposed to resolve the IP model. Finally, by contrast with the calculation results of Distance Priority (DP) and Cycle Time Priority (CTP) algorithms in some scheduling experiments, the feasibility and effectiveness of the model and algorithm were verified. The experimental results also reveal that the form of agile supply chain is competitive.

Key words: supply chain, inserting order scheduling, optimization, time slot, heuristic algorithm

摘要： 针对在敏捷供应链已有生产计划基础上进行的插单调度问题，以单工厂和多供应商组成的两级供应链系统为研究对象，采用时间槽表示可用调度时间，以最小化供应链总成本为目标，建立了调度优化问题的整数规划(IP)模型，设计了求解该模型的逐批选优启发式(OOSH)算法。通过算例将其与距离优先和作业周期优先决策算法比较，验证了启发式算法的有效性，显示了敏捷供应链协同调度可以有效提高供应链的市场竞争力。

关键词: 供应链, 插单调度, 优化, 时间槽, 启发式算法