Track: Manufacturing and Design

Abstract

This paper considers the no-wait flow shop scheduling problem with due date constraints. In the no-wait flow shop problem, waiting time is not allowed between successive operations of jobs. Moreover, a due date is associated with the completion of each job. The considered objective function is makespan. This problem is proved to be strongly NP-Hard. In this paper, a particle swarm optimization (PSO) is developed. To evaluate the performance of the proposed PSO, a number of benchmark problems are selected from the literature and solved with different due date and penalty settings. Computational results confirm that the proposed PSO is efficient and competitive;the developed framework is able to improvemany of the best-known solutions of the test problems available in the literature.

Keywords: Flow Shop Scheduling; No-wait; Due Date Constraints; Makespan; Particle Swarm Optimization