THE ALGORITHM OF NEGOTIATION FOR SOFTWARE AGENTS FOR THE
OPEN CONVEYOR SCHEDULE IN LOGISTICS TASKS
Anatoly Levchenkov,
Transport and Machinery Faculty,
Riga Technical University,
1, Kalku St.,
LV-1658 Riga, Latvia
E-mail: levas@latnet.lv
Mikhail Gorobetz,
Computer Science and Information Technology Faculty,
Riga Technical University,
1, Kalku St.,
LV-1658 Riga, Latvia
Email: mikky@inbox.lv
ABSTRACT: The purpose is to workout an algorithm of negotiation of the software agents [2] for the conveyor scheduling [1] intended for the solution of logistics tasks of the minimization of the usage of resources and a coordination of actions of the logistics process participants. [3]
For the solution of the task a set of processors and a set of jobs is given. Each job consists of a number of operations and each operation is carried out by one processor. Also duration of each operation and directive terms are given.
General algorithm is proposed to solve the task of making a conveyor schedule to co-operate work of software agents.
The scheduling task is represented as cooperative, non-coalition game, where all players are interested in receiving the maximal profit with the minimal costs, not preventing to each other.
All the data for the solution of the task have to be incorporated in a database and the appropriate programming languages and servers will be used for realization of algorithms.
KEYWORDS: Software Agent, Schedule, Cooperative Games, Negotiation, Logistics tasks, E-commerce
Back to HMS2003 Home Page