IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i11p1806-d1666724.html
   My bibliography  Save this article

TANS: A Tolerance-Aware Neighborhood Search Method for Workflow Scheduling with Uncertainties in Cloud Manufacturing

Author

Listed:
  • Haiyan Xu

    (College of Science, JinLing Institute of Technology, Nanjing 211169, China)

  • Fanhao Ma

    (Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications (Southeast University), Ministry of Education, Nanjing 211189, China)

  • Long Chen

    (Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications (Southeast University), Ministry of Education, Nanjing 211189, China)

Abstract

In this paper, we consider the workflow scheduling problem with soft deadlines and fuzzy time uncertainties in cloud manufacturing environments. Workflow tasks in cloud manufacturing often involve uncertain execution and logistics times due to large-scale and geographically distributed resources, creating significant challenges for efficient and reliable scheduling. To address these challenges, we propose the Tolerance-aware Neighborhood Search (TANS) algorithm, which integrates fuzzy time quantization with heuristic neighborhood search techniques. A comprehensive workflow scheduling architecture is established, and multiple neighborhood structures and heuristic search methods are developed to systematically explore feasible solutions. The effectiveness of TANS is verified by extensive experiments and parameter calibrations based on Analysis of Variance (ANOVA). Experimental results indicate that TANS reduces workflow delays by 39% on average compared to state-of-the-art methods, demonstrating high efficiency in scenarios with different numbers of tasks and resources.

Suggested Citation

  • Haiyan Xu & Fanhao Ma & Long Chen, 2025. "TANS: A Tolerance-Aware Neighborhood Search Method for Workflow Scheduling with Uncertainties in Cloud Manufacturing," Mathematics, MDPI, vol. 13(11), pages 1-26, May.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:11:p:1806-:d:1666724
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/11/1806/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/11/1806/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:11:p:1806-:d:1666724. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.