S. Prakash, M.K. Sharma, A. Singh


ENGLISH ABSTRACT: 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.

AFRIKAANSE OPSOMMING: n Multi-doelwit veralgemeende toekenningsprobleem (multi-objective generalised assignment problem MGAP) met twee doelwitte, waar die een line en die ander nieline is nie, word bestudeer, met die randvoorwaarde dat n taak slegs toegedeel word aan een werker alhoewel meer as een taak aan hom toegedeel kan word sou die tyd beskikbaar wees. n Algoritme word voorgestel om die stel Pareto-optimale oplossings te vind wat die taaktoedelings aan werkers onderhewig aan die twee doelwitte doen sonder dat prioriteite toegeken word. Die twee doelwitte is om die totale koste van die opdrag te minimiseer en om die tyd te verminder om al die take te voltooi.


Multi-Objective Generalized Assignment Problem (MGAP); Pareto optimal solutions; total cost of the assignment; Bi-objective Generalized Assignment Problem (BiGAP)

Full Text:




  • There are currently no refbacks.

Copyright (c) 2015 The South African Journal of Industrial Engineering

ISSN 2224-7890 (on-line)

Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help