IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i8p2425-2442.html
   My bibliography  Save this article

Multi-user-oriented manufacturing service scheduling with an improved NSGA-II approach in the cloud manufacturing system

Author

Listed:
  • Tianri Wang
  • Pengzhi Zhang
  • Juan Liu
  • Liqing Gao

Abstract

Manufacturing service scheduling (MSS) is an important step in managing the social resource services in the cloud manufacturing (CMfg) system. However, recent research investigates the problem almost from the task level, and little research considers the demands of multiple users in MSS problem. In this paper, the obvious characteristics of multi-user-oriented MSS are analysed by comparing with the multi-task-oriented MSS problem, and then a multi-user-oriented MSS mathematical model is built to cater to the practical demands of multiple users. In order to solve the proposed model, an improved NSGA-II (INSGA-II), integrating k-means algorithm and local search strategy, is developed to improve the quality of solutions. Six scenarios are given to verify the effectiveness of the proposed algorithm by comparing with other three algorithms from four metrics. The flexibility and universality of the proposed model is examined and the effect of user requirements on the Pareto solution is analysed. The results present the efficiency of k-means cluster and local search in the INSGA-II algorithm and provide a practical solution to select the better schedule for users.

Suggested Citation

  • Tianri Wang & Pengzhi Zhang & Juan Liu & Liqing Gao, 2022. "Multi-user-oriented manufacturing service scheduling with an improved NSGA-II approach in the cloud manufacturing system," International Journal of Production Research, Taylor & Francis Journals, vol. 60(8), pages 2425-2442, April.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:8:p:2425-2442
    DOI: 10.1080/00207543.2021.1893851
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1893851
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1893851?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    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:taf:tprsxx:v:60:y:2022:i:8:p:2425-2442. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.