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

Hierarchical scheduling for multi-composite tasks in cloud manufacturing

Author

Listed:
  • Changcheng Wan
  • Hualin Zheng
  • Liang Guo
  • Yongkui Liu

Abstract

Cloud manufacturing (CMfg) is a new manufacturing mode formed by the integration of information technology and communication technology with manufacturing. As a core role in CMfg, the CMfg platform is responsible for decomposing a large number of tasks from demander and allocating them to available services. The scheduling requires comprehensive consideration of the relevance, complexity and dynamics of task and service. When the decomposable task is multi-composite, how to allocate the optimum services to multi-composite tasks is a tricky and important problem. To solve the issue, a hierarchical scheduling model for multi-composite tasks is proposed, which is divided into user-level scheduling and sublevel scheduling to reduce the scale and difficulty of scheduling. User-level scheduling achieves two-way matching between demander and provider based on various attributes. For the sublevel scheduling, an improved firefly genetic algorithm is created for multi-objective optimisation. A detailed analysis of the hierarchical scheduling strategy is performed by testing several different instances. Experimental results indicate that this strategy reduces the complexity than collective scheduling; and has a better comprehensive balance effect on multiple optimisation goals than sequential scheduling.

Suggested Citation

  • Changcheng Wan & Hualin Zheng & Liang Guo & Yongkui Liu, 2023. "Hierarchical scheduling for multi-composite tasks in cloud manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 61(4), pages 1039-1057, February.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:4:p:1039-1057
    DOI: 10.1080/00207543.2022.2025554
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2025554
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2022.2025554?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:61:y:2023:i:4:p:1039-1057. 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.