SciELO - Scientific Electronic Library Online

 
vol.21 issue2The role of relationship management in the successful outsourcing of maintenanceNew heuristics for minimising total completion time and the number of tardy jobs criteria on a single machine with release time author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Article

Indicators

Related links

  • On index processCited by Google
  • On index processSimilars in Google

Share


South African Journal of Industrial Engineering

On-line version ISSN 2224-7890
Print version ISSN 1012-277X

Abstract

PRAKASH, S.; SHARMA, M.K.  and  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.

        · abstract in Afrikaans     · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License