In this paper we shall give a new solution for the optimal assignation of workers on jobs from the point of view of execution total time minimization using the Simplex algorithm which can solve the problem using computers instead the known Little’s solution. In the second section, we shall...

This paper solves the problem of maximization of the total utility in integer numbers, using first the analysis of integer cases and after with the linear programming in integer numbers.

In this paper we shall give a new solution for the optimal assignation of workers on jobs from the point of view of minimization the maximal execution time using the simplex algorithm which can solve the problem using computers instead the known graphical solution.

This paper solves in a different way the problem of maximization of the total utility using the linear programming in integer numbers. The author uses the diofantic equations (equations in integers numbers) and after a decomposing in different cases, he obtains the maximal utility.