Аннотация:

 We consider the NP-hard multiprocessor scheduling problem with renewable and non-renewable resources that influence on the processing times of jobs.
       We propose an evolutionary algorithm with optimized operators and problem specific encoding scheme. The optimal recombination problem is solved in the crossover operator. The computational complexity of this problem and the convergence of the algorithm are analyzed. An experimental evaluation on real data shows that the algorithm demonstrates competitive results.  A mixed integer programming model is also proposed and its properties are investigated.