Kybernetika

In the paper we investigate the inject press optimization problem with parallel matrices on the machine. A production order must be realized in a whole assortment and it is requested to minimize the production time and the number of matrix exchanges. The problem can be formulated as a parallel--machine scheduling problem with two criteria: to minimize the makespan and to minimize the number of job preemption. A simple heuristic algorithm for solving this NP--hard problem is proposed.