Schedule coordination through egalitarian recurrent multi-unit combinatorial auctions

摘要: When selfish industries are competing for limited shared resources, they need to coordinate their activities handle possible conflicting situations. Moreover, this coordination should not affect the already planned by industries, since could have negative effects on performance. Although agents may buffers that allow them delay use of these a finite capacity, and therefore cannot be used indiscriminately. Thus, we faced with problem coordinating schedules been generated agents. To address task, propose recurrent auction mechanism mediate between Through mechanism, can express interest in using thus helping scheduler find best distribution. We also introduce priority add fairness process. The proposed has applied waste water treatment system scenario, where different discharge waste. simulated behavior system, results show our plant successfully treat most discharges, while production activity is almost affected it.