关键词: 通用作业计划, 作业排序, 蚁群算法, 生产管理

Abstract: After the relationship of Universal-Special in basic shops was analyzed, the concept of Universal Shop scheduling Problem (USP), which included all basic shop scheduling problems, was put forward. A disjunctive graph model representing USP was established, and the Ant Colony Optimization (ACO) used for USP was demonstrated. A case study assumed that a manufacturing system contained OSP, JSP and HFSP. When the system was treated as USP, the approximately optimal makespan computed by ACO was obviously better than the least makespan by enumerating all the possible solutions as the three shops were scheduled separately.

Key words: universal shop scheduling, sequencing, ant colony optimization, production management