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

This is one of the most difficult problems in combinatorial optimization, with even modest sized instances being computationally intractable. Getting inspiration from a number of advances in solving this notoriously difficult problem, we develop a new approximate optimization approach, which is based on the imperialist competitive algorithm hybridized with an efficient neighborhood search. The effectiveness of the proposed approach is demonstrated through an experimental evaluation.