关键词: 柔性车间调度, 工艺路径柔性, 机器柔性, 蚁群算法

Abstract: For Flexible Job-shop Scheduling Problem with Multiple Process Plans (FJSP-MPP),a Four-Tuple based Mathematical Scheme (FTMS) was proposed for describing processing flexibility and operation flexibility.With the optimization objective of minimizing the makespan,a mathematical model on FJSP-MPP was constructed.Without establishing upfront the disjunctive graph model for FJSP-MPP,the ant path oriented to this problem was generated based on related algorithms of Allowed and Tabu lists for OR-subgraph and job.By introducing an extra pheromone on node,and modifying the pheromone update strategy and transition probability rule,an integrated scheduling algorithm for FJSP-MPP based on ant colony optimization was developed.The comparison and analysis of four different scale scheduling problems showed that the proposed algorithm had a good optimization performance.

Key words: flexible job-shop scheduling, processing flexibility, operation flexibility, ant colony algorithm