یک الگوریتم حریصانه تکراری مکرر برای برنامه ریزی ماشین آلات دسته موازی مرتبط با ظرفیت های غیر یکسان و زمان های آماده نابازی

In this paper, we first provide a lower bound for the problem and a mixed integer programming (MIP) model. To solve the problem, a meta-heuristic based on the iterated greedy (IG) algorithm is proposed. IG is a simple meta-heuristic which generates a sequence of solutions by iterating over a greedy constructive heuristic using destruction and construction operations. In the recent literature this meta-heuristic has been employed to solve a considerable number of combinatorial optimization problems. This is because IG is easy to implement and it often exhibits an excellent performance. The effectiveness of the proposed IG algorithm is evaluated and compared by computational experiments on a large benchmark of randomly generated instances. The obtained results indicate that the proposed algorithm has a superior performance compared to some meta-heuristic algorithms proposed for similar problems.