/npsi/ctrl?lang=en http://nparc.cisti-icist.nrc-cnrc.gc.ca/npsi/ctrl?lang=fr Access and use of this website and the material on it are subject to the Terms and Conditions set forth at http://nparc.cisti-icist.nrc-cnrc.gc.ca/npsi/jsp/nparc_cp.jsp?lang=en
NRC Publications Archive Archives des publications du CNRCThis publication could be one of several versions: author's original, accepted manuscript or the publisher's version. / La version de cette publication peut être l'une des suivantes : la version prépublication de l'auteur, la version acceptée du manuscrit ou la version de l'éditeur. Systems, Man, and Cybernetics, Part C, 38, 2, pp. 269-273, 2008-03-01 Distributed scheduling for reactive maintenance of complex systems Wang, C.; Ghenniwa, H.; Shen, W.
IEEE Transactions onhttp://irc.nrc-cnrc.gc.ca Distributed scheduling for reactive maintenance of complex systems
NRCC-50278Wang, C.; Ghenniwa, H.; Shen, W.
March 2008A version of this document is published in / Une version de ce document se trouve dans: IEEE Transactions on Systems, Man, and Cybernetics, Part C, v. 38, no. 2, 2008, .pp 269-273 The material in this document is covered by the provisions of the Copyright Act, by Canadian laws, policies, regulations and international agreements. Such provisions serve to identify the information source and, in specific instances, to prohibit reproduction of materials without written permission. For more information visit http://laws.justice.gc.ca/en/showtdm/cs/C-42Les renseignements dans ce document sont protégés par la Loi sur le droit d'auteur, par les lois, les politiques et les règlements du Canada et des accords internationaux. Ces dispositions permettent d'identifier la source de l'information et, dans certains cas, d'interdire la copie de documents sans permission écrite. Pour obtenir de plus amples renseignements : http://lois.justice.gc.ca/fr/showtdm/cs/C-42 > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < Abstract-This paper presents a distributed scheduling algorithm for reactive maintenance of complex systems. The proposed algorithm uses an iterative bidding procedure to assign operations of maintenance jobs to engineers with partially overlapped skill sets. In each round, an unassigned operation is selected based on the overlapping degree of engineers' skill sets on the operation and its average processing time among capable engineers. Engineers' availability and cost information are used to determine the winner of an assignment. The effectiveness of this approach is demonstrated through a computational case study. Prototype implementation and applications to real world domains are discussed.