| Popis: |
A kind of negotiation policy is proposed for the allocation problem solved by agent-based system in distributed manufacturing environment, in which subtasks in the same task have in-tree precedence constraints and flexible routes. With the formulation of the problem and that of combinatorial auction solution, the design, the procedure and the implementation of combinatorial auction are given. The final part of the paper gives numerical test to demonstrate the policy to be feasible and efficient. |
