计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2013年
21期
15-18
,共4页
粒子群算法%柔性车间作业调度问题%最小化完工时间%邻域搜索
粒子群算法%柔性車間作業調度問題%最小化完工時間%鄰域搜索
입자군산법%유성차간작업조도문제%최소화완공시간%린역수색
Particle Swarm Optimization(PSO)algorithm%flexible job shop scheduling problem%makespan%neighborhood search
柔性作业车间调度问题是典型的NP难题。柔性作业车间调度问题涉及到设备分配和作业分配两个问题，并且两问题之间具有较强的耦合性，提出了基于协同进化的粒子群算法。该算法将设备选择和工件调度分别作为两个寻优变量，利用PSO算法分别进行寻优，根据两个变量的内容进行互相评价。实验表明该算法对FJSP问题的有效性。
柔性作業車間調度問題是典型的NP難題。柔性作業車間調度問題涉及到設備分配和作業分配兩箇問題，併且兩問題之間具有較彊的耦閤性，提齣瞭基于協同進化的粒子群算法。該算法將設備選擇和工件調度分彆作為兩箇尋優變量，利用PSO算法分彆進行尋優，根據兩箇變量的內容進行互相評價。實驗錶明該算法對FJSP問題的有效性。
유성작업차간조도문제시전형적NP난제。유성작업차간조도문제섭급도설비분배화작업분배량개문제，병차량문제지간구유교강적우합성，제출료기우협동진화적입자군산법。해산법장설비선택화공건조도분별작위량개심우변량，이용PSO산법분별진행심우，근거량개변량적내용진행호상평개。실험표명해산법대FJSP문제적유효성。
The flexible job shop scheduling problem is a typical NP-hard problem. This problem involves two problems, such as equipment allocation and job assignment, and these two problems have strong couplings. To solve this problem a co-evolution Particle Swarm Optimization algorithm is proposed. The algorithm solves the equipment allocation and job assignment as two optimization variables, optimized respectively and evaluated mutually according to the contents of them. The experiments show the algorithm has obvious advantage on FJSP problem.
