Resumo

PRAKASH, S.; SHARMA, M.K.  e  SINGH, A.. Pareto optimal solutions for multi-objective generalized assignment problem. S. Afr. J. Ind. Eng. [online]. 2010, vol.21, n.2, pp.91-100. ISSN 2224-7890.

The Multi-Objective Generalized Assignment Problem (MGAP) with two objectives, where one objective is linear and the other one is non-linear, has been considered, with the constraints that a job is assigned to only one worker - though he may be assigned more than one job, depending upon the time available to him. An algorithm is proposed to find the set of Pareto optimal solutions of the problem, determining assignments of jobs to workers with two objectives without setting priorities for them. The two objectives are to minimise the total cost of the assignment and to reduce the time taken to complete all the jobs.

        · resumo em Africaner     · texto em Inglês     · Inglês ( pdf )