A discussion of the job scheduling problem of assigningnparts to be processed tom
machines is made. Withmachines allowed to be idle and a idea of load introduced, where loadmeans the
maximum of parts processed by each machine, an extended model and a generalized algorithm are
obtained without the constraint ofm≤n.The results of an example prove the effectiveness of the model
and algorithm proposed in this paper.