Optimization of office process task allocation based on deep reinforcement learning
DOI:
https://doi.org/10.59782/sidr.v2i1.59Keywords:
workflow, task scheduling, Markov chain, deep reinforcement learning, collaborationAbstract
In office platforms, we often need to face the situation of a large number of parallel heterogeneous process tasks. This not only tests the ability of the task executors themselves, but also puts forward requirements for the performance of the collaborative scheduling system. Using the reinforcement learning method, combined with quantitative analysis such as collaborative coordination and slackness, and based on the Markov Bollinger theory, a multi-agent Bollinger model is proposed to realize the optimization scheduling system with overall process coordination and maximum completion time as the optimization objectives, thereby improving the overall execution efficiency. Taking the real business system process as the test scenario, under the same optimization objective, the reinforcement learning algorithm based on D3QN and DRL and the meta-heuristic algorithm based on ant colony are compared to verify the effectiveness of the proposed method.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2024 Scientific Insights and Discoveries Review

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.