Trustworthy and efficient project scheduling in IIoT based on smart contracts and edge computing

To facilitate flexible manufacturing, modern industries have incorporated numerous modular operations such as multi-robot services which can be expediently arranged or offloaded to other production resources. However, complex manufacturing projects often consist of multiple tasks with fixed sequence...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of Cloud Computing 2025-12, Vol.14 (1), p.2-16, Article 2
Hauptverfasser: Liu, Peng, Wu, Xinglong, Peng, Yanjun, Shan, Hangguan, Mahmoudi, Saïd, Choi, Bong Jun, Lao, Haksrun
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:To facilitate flexible manufacturing, modern industries have incorporated numerous modular operations such as multi-robot services which can be expediently arranged or offloaded to other production resources. However, complex manufacturing projects often consist of multiple tasks with fixed sequences, posing a significant challenge for smart factories in efficiently scheduling limited robot resources to complete specific tasks. Additionally, when projects span across factories, ensuring faithful execution of contracts becomes another challenge. In this paper, we propose a modified combinatorial auction method combined with blockchain and edge computing technologies to organize project scheduling. Firstly, we transform efficient resource scheduling into a resource-constrained multi-project scheduling problem (RCPSP). Subsequently, the solution integrates combinatorial auction with random sampling (CA-RS) into smart contracts. Alongside security analysis, simulations are conducted using real data sets. The results indicate that the suggested CA-RS approach significantly enhances efficiency and security in resource arrangement within the industrial Internet of Things compared to baseline algorithms.
ISSN:2192-113X
2192-113X
DOI:10.1186/s13677-025-00726-z