求解次序相依准备时间Hybrid Flowshop调度的离散ICA算法

摘要

Setup times are either ignored or assumed independent of the job sequence in most of the research on Hybrid Flowshop scheduling nowadays. Handles the Hybrid Flowshop scheduling problems with sequence dependent setup times, also known as SDST Hybrid Flowshop. This kind of system is quite common in industries like chemical, textile, metallurgical,printed circuit board, and automobile manufacturing. The mixed integer linear programming model is presented. Due to the complexity of this prob-. lem,the implementation of accurate approaches such as branch and bound is out of the question. A novel discrete imperialist com-petitive algorithm is developed,and compared with the Random Key Genetic Algorithm proposed by Kura and Askin and the Simulated Annealing proposed by Zandieh et al. The result indicates that the ICA algorithm outperforms both the other two methods.%以往对工厂生产调度的研究往往忽略机器准备时间或者假设机器准备时间与前后任务无关.探讨存在次序相依准备时间Hybrid Flowshop调度问题,这类生产系统常见于化工、纺织、冶金、印刷电路板及汽车行业.给出该问题的混合整数规划模型,由于问题的复杂性,分枝定界法等精确解法并不适用.提出求解次序相依准备时间Hybrid Flowshop调度的离散ICA算法,并与已有的随机键遗传算法和模拟退火算法进行比较.结果表明,求解次序相依准备时间Hybrid Flowshop调度的离散ICA算法性能优于以上两种算法.