准序化供货模式下的混装线重排序  

Resequencing mixed-model assembly lines with just-in-sequence supply

作　　者：李军[1] 孙辉[1] 

机构地区：[1]东南大学机械工程学院,江苏南京211189

出　　处：《计算机工程与科学》2016年第3期595-602,共8页Computer Engineering & Science

基　　金：留学回国人员科研启动基金(教外留司[2011]508号)

摘　　要：准序化供货是在准时制的基础上对零部件进行排序供货,其顺利实施需要依靠稳定的生产序列与零部件交付的可靠性。针对零部件交付过程中的意外事件,研究了受到意外事件影响时的工件重排序问题。首先以最小化所有工件在各工作站的超载时间与空闲时间总成本为目标,建立了问题的数学模型,并提出了三种贪婪规则和一种模拟退火算法。接着设计了算例来验证算法的性能。实验结果表明,四种算法均可在较短的时间内起到重排序的效果,其中模拟退火算法效果最好,也优于文献中的局部搜索算法。最后讨论了影响算例运行结果的因素。Just-in-sequence（JIS）is a supplement to just-in-time by providing supplied parts in the right sequence.The successful implementation of JIS depends on stable sequence and reliable delivery.Aiming at the accidents in the process of delivery,we present a method for resequencing mixed-model assembly lines.Firstly,to minimize the total cost of overload time and free time,we also present a mathematical formulation,and propose three greedy rules and a simulated annealing algorithm.Numerical examples are designed to verify the performance of these algorithms.Computational experiments show that the four algorithms have the effects of resequencing in short time,and the simulated annealing algorithm is the best and superior to the local search algorithms in literature.We also discuss the factors that affect the numerical examples＇ results.

关 键 词：准序化 意外事件 重排序 模拟退火 

分 类 号：F406[经济管理—产业经济]