<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Hedjazi, D.</style></author><author><style face="normal" font="default" size="100%">Layachi, F</style></author><author><style face="normal" font="default" size="100%">Djallel Eddine Boubiche</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A multi-agent system for distributed maintenance scheduling</style></title><secondary-title><style face="normal" font="default" size="100%">Computers &amp; Electrical Engineering (Elsevier, Impact factor: 2.189)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S004579061832620X#aep-article-footnote-id1</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">77</style></volume><pages><style face="normal" font="default" size="100%">1-11</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	Due to the intrinsically geo-distributed subcontracting maintenance activity practice, the maintenance scheduling has for a long time been a major challenge in the industry. This research work presents a methodology to schedule the maintenance activities of geo-distributed assets. A multi-agent system based approach is proposed to enable the decision-making for the subcontractors in a distributed industrial environment under uncertainty. An auction based negotiation mechanism is designed to promote competition and cooperation among the different agents, and to obtain global good schedule.Compared to the&amp;nbsp;Weighted Shortest Processing Time first–Heuristic–Earliest Due Date (&lt;em&gt;WSPT-H-EDD&lt;/em&gt;) method,&amp;nbsp;the experimental results show that the proposed approach is able to provide scheduling scheme with good performances in terms of Global Cost, Total Weighted Tardiness Cost and makespan
&lt;/p&gt;
</style></abstract><notes><style face="normal" font="default" size="100%">&lt;b&gt;Elsevier&lt;/b&gt;, 2019, &amp;nbsp;&lt;b&gt;&lt;i&gt;Impact factor: 2.189&lt;/i&gt;&lt;/b&gt;</style></notes></record></records></xml>