<?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%">Djalal HEDJAZI</style></author><author><style face="normal" font="default" size="100%">Fateh Layachi</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%">https://www.sciencedirect.com/science/article/pii/S004579061832620X⋕!https://www.sciencedirect.com/science/article/pii/S004579061832620X⋕!</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2019</style></date></pub-dates></dates><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%">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 (WSPT-H-EDD) 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.</style></abstract></record></records></xml>