Abstract: The scheduling problem of serial multiproduct batch processes which attracts more and more attention in recent years is difficult to solve by some exact mathematical methods such as mixed integer programming (MIP) methods or branch and bound (BAB) when the size of the problem is large.This is mainly due to its NP complete nature.Simulated annealing (SA) has been proved to be efficient in finding an optimal solution for this kind of problem,but it requires considerable computing time for large problems.In this paper,an improved SA algorithm is proposed for solving the addressed scheduling problem for serial multiproduct batch processes with unlimited intermediate storage (UIS).The key to the improvement of the algorithm is the adoption of a non equilibrium and repeated annealing strategy,as well as various methods for generating neighboring solutions.Compared with presently available simulated annealing algorithms,the proposed algorithm gives better solution and runs faster in solving the addressed scheduling problem.Even for a very large scheduling problem,it can get reasonable result in acceptable computing time.The method appears to be promising for scheduling serial multi product batch processes.

摘要： 提出了一种适用于多产品间歇化工过程排序的改进模拟退火算法 ,该算法采用了非平衡、多次退火策略及多个相邻解产生方法 .通过对无限中间储罐 (UIS)类问题的研究表明 ,同已有的方法相比 ,该方法求解精度高 ,计算速度快 ,适合于求解多产品间歇化工过程的排序问题 .