پیچیدگی به حداقل رساندن دیر کار در سیستم های فروشگاه جریان و الگوریتم بهینه سازی ذرات برای اثر یادگیری

Late work minimization is one of the newer branches in the scheduling theory, with the goal of minimizing the total size of late parts of all jobs in the system. In this paper, we study the scheduling problem in flow shop, which finds many practical applications. First, we prove that the problem with three machines and a common due date is NP-hard in the strong sense. Then we extend this basic model, considering the problem with the arbitrary number of machines, various due dates and learning effect, and propose a particle swarm optimization algorithm (PSO). Computational experiments show that the PSO is an efficient method for solving the problem under consideration, both from algorithm-performance and time-consumption views.