1887

n South African Journal of Industrial Engineering - Pareto optimal solutions for multi-objective generalized assignment problem : general article

Volume 21, Issue 2
  • ISSN : 1012-277X
USD

 

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.

'n Multi-doelwit veralgemeende toekenningsprobleem ("multi-objective generalised assignment problem - MGAP") met twee doelwitte, waar die een lineêr en die ander nie-lineêr 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.

Loading full text...

Full text loading...

Loading

Article metrics loading...

/content/indeng/21/2/EJC46251
2010-11-01
2016-12-11

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error