We investigate a well known problem of scheduling independent parallel machines so as to minimize the overall finishing time. We introduce two generalization possibilities of classical algorithm LPT of Graham. In the general algorithm we search for the optimal schedule of the next tasks, in case this is the original algorithm. Increasing the theoretical efficiency is improving. The numerical behavior of the generalized algorithms is also treated.
(Die Teilnahme an der Konferenz wird druch die Stiftung von Hans Pape, Dortmund, Dr.h.c. der Universität Veszprém unterstützt.)