Optimization of Asynchronous Parallel Tasks Scheduling with Multi-resource Constraints
DOI:
https://doi.org/10.31449/inf.v48i7.5604Abstract
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.
Downloads
Published
Issue
Section
License
I assign to Informatica, An International Journal of Computing and Informatics ("Journal") the copyright in the manuscript identified above and any additional material (figures, tables, illustrations, software or other information intended for publication) submitted as part of or as a supplement to the manuscript ("Paper") in all forms and media throughout the world, in all languages, for the full term of copyright, effective when and if the article is accepted for publication. This transfer includes the right to reproduce and/or to distribute the Paper to other journals or digital libraries in electronic and online forms and systems.
I understand that I retain the rights to use the pre-prints, off-prints, accepted manuscript and published journal Paper for personal use, scholarly purposes and internal institutional use.
In certain cases, I can ask for retaining the publishing rights of the Paper. The Journal can permit or deny the request for publishing rights, to which I fully agree.
I declare that the submitted Paper is original, has been written by the stated authors and has not been published elsewhere nor is currently being considered for publication by any other journal and will not be submitted for such review while under review by this Journal. The Paper contains no material that violates proprietary rights of any other person or entity. I have obtained written permission from copyright owners for any excerpts from copyrighted works that are included and have credited the sources in my article. I have informed the co-author(s) of the terms of this publishing agreement.
Copyright © Slovenian Society Informatika
