准序化供货是在准时制的基础上对零部件进行排序供货,其顺利实施需要依靠稳定的生产序列与零部件交付的可靠性。针对零部件交付过程中的意外事件,研究了受到意外事件影响时的工件重排序问题。首先以最小化所有工件在各工作站的超载时间与空闲时间总成本为目标,建立了问题的数学模型,并提出了三种贪婪规则和一种模拟退火算法。接着设计了算例来验证算法的性能。实验结果表明,四种算法均可在较短的时间内起到重排序的效果,其中模拟退火算法效果最好,也优于文献中的局部搜索算法。最后讨论了影响算例运行结果的因素。 Sequential supply is based on the punctuality of the parts on the order of supply, the smooth implementation of the need to rely on the stability of the production sequence and the reliability of component delivery. In the light of the accidents in the parts delivery, the problem of reordering the workpieces when the accidents are affected is studied. Firstly, aiming at minimizing the total cost of overloading and idle time of all workpieces at each workstations, a mathematical model of the problem was established and three greedy rules and a simulated annealing algorithm were proposed. Then, an example is designed to verify the performance of the algorithm. The experimental results show that the four algorithms can be reordered in a relatively short period of time. The simulated annealing algorithm has the best performance and is superior to the local search algorithm in the literature. Finally, the factors that influence the result of the calculation are discussed.