GENERAL ARTICLE

 

Pareto optimal solutions for multi-objective generalized assignment problem

 

 

S. Prakash^I; M.K. Sharma^II; A. Singh^III

^IDepartment of Applied Sciences, Amity School of Engineering & Technology, New Delhi, India sprakash@aset.amity.edu
^IISchool of Mathematics & Computer Applications, Thapar University, Patiala, India mksharma@thapar.edu
^IIIDepartment of Applied Sciences, Baba Banda Singh Bahadur Engineering College, Fatehgarh Sahib, India amarinder77@gmail.com

 

 

---

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.

---

OPSOMMING

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

---

 

 

“Full text available only in PDF format”

 

 

REFERENCES

[1] Amini, M.M. & Racer, M. 1995. A hybrid heuristic for the generalized assignment problem, European Journal of Operational Research, 87, pp 343-348.         [ Links ]

[2] Cattrysse, D.G. & Wassenhove, L.N.V. 1992. A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, 60, pp 260-272.         [ Links ]

[3] Chu, P.C. & Beasley, J.E. 1997. A genetic algorithm for the generalized assignment problem, Computers & Operations Research, 24, pp 17-23.         [ Links ]

[4] Diaz, J.A. & Fernandez, E. 2001. A tabu search heuristic for the generalized assignment problem, European Journal of Operational Research, 132, pp 22-38.         [ Links ]

[5] Evans, G.W. 1984. An overview of techniques for solving multiobjective mathematical programs, Management Science, 30, pp 1268-1282.         [ Links ]

[6] Fu, Y. & Diwekar, U.M. 2004. An efficient sampling approach to multiobjective optimization, Annals of Operations Research, 132, pp 109-134.         [ Links ]

[7] Gandibleux, X. & Freville, A. 2000. Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objective case, Journal of Heuristics, 6, pp 361-383.         [ Links ]

[8] Haddadi, S. & Ouzia, H. 2004. Effective algorithm and heuristic for the generalized assignment problem, European Journal of Operational Research, 153, pp 184-190.         [ Links ]

[9] Ignizio, J.P. 1982. Linear programming in single and multi-objective systems, Prentice-Hall, Englewood Cliffs, New Jersey.         [ Links ]

[10] Junker, U. 2004. Preference based search and multi-criteria optimization, Annals of Operations Research, 130, pp 75-115.         [ Links ]

[11] Kasana, H.S. & Kumar, K.D. 2004. Introductory operations research. Theory and applications, Springer-Verlag, Berlin.         [ Links ]

[12] Lourengo, H.R., Paixao, J.P. & Portugal, R. 2001. Multiobjectives metaheuristics for the bus driver scheduling problem, Transport Science, 35, pp 331-343.         [ Links ]

[13] Lourengo, H.R. & Serra, D. 1998. Adaptive approach heuristics for the generalized assignment problem, preprint.         [ Links ]

[14] Zhang, C.W. & Ong, H.L. 2007. An efficient solution to biobjective generalized assignment problem, Advances in Engineering Software, 38, pp 50-58.         [ Links ]

 

 

* Corresponding author.