It is considered the embedment of n classes of elements (jobs) Ai,i∈N, to m∈1 parallel bins Cj,j∈M, where the bins have to contain only elements of one class. For the solution of one-stage problems three polynomial Greedy algorithms are proposed. One of them solves two classes of problems with weighted objective functionals and the others handle six classes of problems which the jobs Ai,i∈N, have the same priority. Polystage problems are solved via a series of Greedy algorithms, such that the embedment into the bins Cj,j∈M, strictly takes place in the priority of jobs Ai,i∈N.
