面向IC生产模式的Job Shop调度问题的研究

Research on Job Shop Scheduling Aiming at IC Production

针对即时定制生产模式的车间调度的特点,提出基于粒子群算法(PSO)的车间调度问题的解决方案。利用粒子群算法本身的优越性解决复杂的车间作业排序问题,克服了传统调度算法存在寻优效率低或全局寻优能力差的弱点。对粒子群的编码及寻优操作进行研究,确定了更适合车间调度问题的编码和操作方式,并将算法进行编程,应用到系统的车间调度部分。仿真结果表明,通过设置适当的参数,可以快速地得到理想的排序结果,能够适用于IC生产模式的车间调度问题。

Aiming at the characteristics of IC （ Instant Customisation ） and its job shop scheduling problem and considering the conventional algorithms＇ low efficiency of search and low capacity of global search, PSO - based solution to job shop scheduling problem of IC is presented. According to the characteristics of the problem, the PSO coding and optimization are studied to determine the way of coding and operation, which is more adaptable to job shop scheduling. The job shop scheduling part of the system is then pro- grammed with the algorithm. Simulation results show that setting the suitable parameters can provide an excellent working sequence to adapt to the IC job - shop problem. At last, a suggestion about this problem is presented.