Influence of Fixed-Deadline Orders on Memetic Algorithm Performance in Production Planning

The paper presents the evaluation of memetic algorithm with the real production planning problem, which consists of many constraints. Additionally, there are some orders with fixed deadlines that have to be produced on the exact day. The memetic algorithm with specialized local searches is able to effectively improve solutions acquired by genetic algorithm even if many orders with fixed deadlines are given.