IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v33y2026i4p433-464.html

A weighted neutrosophic fuzzy goal programming approach to optimise multi-objective assignment problem

Author

Listed:
  • Debasmita Sarkar
  • Pankaj Kumar Srivastava

Abstract

Assignment problems (APs) hold significant in industrial organisation, resource allocation, developing service systems, etc. Assigning appropriate jobs to the right employees is crucial when aiming to achieve objectives like cost-saving, ensuring production quality, and estimating production time. Decision makers (DMs) face immense pressure to optimise all of the objectives simultaneously determined to thrive in today's rapidly evolving market. Therefore, here considers, multi-objective assignment problems (MOAPs) to optimise all the objectives comprehensively. Additionally, only a tiny portion of the literature concentrates on both the quality of the commodities and the consistency of the objective functions while solving MOAPs and the consistency of the objective functions. Thus, in the proposed study, each task's quality undergoes evolution using a neutrosophic linguistic scale. Weights are determined employing the neutrosophic analytic hierarchy process (NAHP) to avoid comparisons and ensure the consistency in the objective functions. The weighted single valued neutrosophic fuzzy goal programming (WSVNFGP) method is proposed to resolve the deterministic MOAP and find Pareto-optimal solutions by combining weights. The study is strengthened by a fair contrast of the proposed algorithm with other widely-used approaches, leading to approval of the reasonability of the proposed algorithm over other schemes.

Suggested Citation

  • Debasmita Sarkar & Pankaj Kumar Srivastava, 2026. "A weighted neutrosophic fuzzy goal programming approach to optimise multi-objective assignment problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 33(4), pages 433-464.
  • Handle: RePEc:ids:ijmore:v:33:y:2026:i:4:p:433-464
    as

    Download full text from publisher

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

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:33:y:2026:i:4:p:433-464. 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.