Faculty of Management & Accounting, Department of Industrial Management, Islamic Azad University South Tehran Branch, Tehran, Iran
Faculty of Entrepreneurship, University of Tehran, Tehran, Iran
Abstract This paper considers a flexible assembly job shop scheduling problem with the sequence dependent setup times, and its objective is 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 algorithm in the discrete modeled problem. The numerical experiments also have been performed to demonstrate the effectiveness of the proposed algorithm.