Optimization of Asynchronous Parallel Tasks Scheduling with Multi-resource Constraints

Abstract

Complex equipment disassembly tasks often require a group of people to complete, and the same time satisfying various resource constraints. This paper proposes an improved elite genetic algorithm (IGA) for the asynchronous parallel disassembly (APD) problem with the task priority, disassembly workspace interference and human resource constraints. The feasibility and effectiveness of the algorithm are verified through a hydraulic turbine hoisting and disassembling task instance. Results show that compared with classical algorithms (ACO&AGA) applied in APD, the proposed method is feasible and effective, and also has practical guiding significance for planning complex disassembling projects.

Authors

  • Zhang Xinyu
  • Liu JinJian
  • Zhang Guanwei
  • Guo Wei

DOI:

https://doi.org/10.31449/inf.v48i7.5604

Downloads

Published

04/17/2024

How to Cite

Xinyu, Z., JinJian, L., Guanwei, Z., & Wei, G. (2024). Optimization of Asynchronous Parallel Tasks Scheduling with Multi-resource Constraints. Informatica, 48(7). https://doi.org/10.31449/inf.v48i7.5604

Issue

Vol. 48 No. 7 (2024): Online-only issue

Section

Online-only

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.