On scheduling with technology based machines grouping

A problem of multi-product scheduling is considered. Each product can be produced by a family of alternative multi-machine technologies which require more than one machine at the same time. The problem is studied in two versions: with and without preemptions of technologies processing. We formulate mixed integer linear programming models for both versions. Two genetic algorithms are proposed and experimentally tested. The first one is based on a uniform crossover and the second one uses a new optimal recombination operator. Convergence of the proposed algorithms is investigated. Computational complexity of the problem is analyzed. Ill. 1, tab. 5, bibliogr. 28.