A Particle Swarm Optimization to Minimize Makespan for a Four-Stage Multiprocessor Open Shop with Dynamic Job Release Time

作     者：Hui-Mei Wang Fuh-Der Chou 

作者机构：Department of Hotel Management Vanung University Taoyuan Chinese Taipei Department of Industrial Management Chien Hsin University Taoyuan Chinese Taipei 

出 版 物：《World Journal of Engineering and Technology》 (世界工程和技术（英文）)

年 卷 期：2015年第3卷第3期

页      面：78-83页

学科分类：1002[医学-临床医学] 100214[医学-肿瘤学] 10[医学] 

主　　题：Open Shop Multiprocessor Makespan Particle Swarm Optimization 

摘      要：This paper considers the scheduling problem observed in chip sorting operation of LED manufacturing, where each lot (job) with release time have four operations to be processed on a set of processing stages without pre-determined necessary route. Each stage has one and more identical sorting machines. The sorting machines scheduling problem can be treated as a four-stage multiprocessor open shop problem with dynamic job release, and the objective is minimizing the makespan in the paper. This problem is formulated into a mixed integer programming (MIP) model and empirically shows its computational intractability. Due to the computational intractability, a particle swarm optimization (PSO) algorithm is proposed. A series of computational experiments are conducted to evaluate the performance of the proposed PSO in comparison with exact solution on various small-size problem instances. The results show that the PSO algorithm could finds most optimal or better solutions in one second.