Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
This paper examines planning management problems in a Multiagent-based Distributed Open Computing Environment Model (MDOCEM). We first introduce the meaning of planning management in MDOCEM. We then present a formal method to describe the associated task partition problems, and give a heuristic algorithm which gives an approximate optimum solution. Finally the task coordination and integration of execution results are discussed.