Multiagent systems for the hoist scheduling problem

In this article a new approach for solving the hoist scheduling problem is proposed. It is based on two distinct, though coupled, multiagent systems. The first system is responsible for making a decision about the input date for the next job, while the second system is concerned with the assignment of transfer operations of jobs between tanks to the hoists. These multiagent systems use two different types of auction mechanisms to attain cooperation. Remaining conflicts are solved through self-assigned priorities. Partial results are proposed and issues related to further work on the topic are raised.