科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper considers a flexible assembly job shop scheduling problem with sequence dependent setup times, and its objective is the minimization of makespan, which integrates the process planning and scheduling activities. This is a combinatorial optimization problem with substantially large solution space, suggesting that it is highly difficult to find the best solution with the exact search method. In this paper, a particle swarm optimization based algorithm is proposed, which applies a novel solution representation method to fit the continuous nature of the algorithm in the discrete modeled problem. Numerical experiments also have been performed to demonstrate the effectiveness of the proposed algorithm.
- 出版日期2014-6
