IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v13y2018i1p107-127.html
   My bibliography  Save this article

Multi-objective unbalanced assignment problem with restriction of jobs to agents via NSGA-II

Author

Listed:
  • Amiya Biswas
  • Asoke Kumar Bhunia
  • Ali Akbar Shaikh

Abstract

In this paper, an approach based on genetic algorithm has been proposed for solving multi-objective unbalanced assignment problems with restriction of job(s) to different agents which may arise due to the inability/poor efficiency of performing certain jobs by some agents dealing with an additional constraint on the maximum number of jobs that can be performed by an agent. As the cost and time are considered as the most important factors for managerial decision in economic/industrial establishments, so here the total cost of assignment of jobs to agents and the total time of completion of jobs by the agents are considered as the two prime objectives. This gives rise to an NP-hard 0-1 programming problem and to solve this problem, we have equipped NSGA-II with a newly developed crossover having the capability of repairing infeasible solution and two new mutation schemes. Also, for comparison of the results obtained from this algorithm, some other variants of this algorithm with existing crossover and mutation schemes have been considered. Finally, to illustrate the performance of proposed approach, a set of test problems have been solved and the results have been analysed for different variants of NSGA-II and some potential future research directions has been discussed.

Suggested Citation

  • Amiya Biswas & Asoke Kumar Bhunia & Ali Akbar Shaikh, 2018. "Multi-objective unbalanced assignment problem with restriction of jobs to agents via NSGA-II," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 13(1), pages 107-127.
    • Handle: RePEc:ids:ijmore:v:13:y:2018:i:1:p:107-127
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=92967
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:13:y:2018:i:1:p:107-127. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.