{"title":"A multi-agent system for decentralised fractional shared resource constraint scheduling","authors":"Gaurav Singh, René Weiskircher","doi":"10.3233/WIA-2011-0208","DOIUrl":null,"url":null,"abstract":"We consider a collaborative scheduling problem motivated by mining in remote off-grid areas. In our model, jobs are preassigned to processors who have their own machine for executing them. Because each job needs a certain amount of a resource shared between the processors, a coordination mechanism between the processors is needed. We present a framework which collaboratively computes a schedule while exchanging only limited information between the processors and a central resource manager. Our computational experiments show that our negotiated approach outperforms a one-shot solution approach by a wide margin and produces fairer solutions than a centralised genetic algorithm that can make use of the private information of each processor. Depending on the number of processors, the solution quality found by the mechanism presented in this paper is competitive with or even better than that of the centralised genetic algorithm.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Web Intell. Agent Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/WIA-2011-0208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23
Abstract
We consider a collaborative scheduling problem motivated by mining in remote off-grid areas. In our model, jobs are preassigned to processors who have their own machine for executing them. Because each job needs a certain amount of a resource shared between the processors, a coordination mechanism between the processors is needed. We present a framework which collaboratively computes a schedule while exchanging only limited information between the processors and a central resource manager. Our computational experiments show that our negotiated approach outperforms a one-shot solution approach by a wide margin and produces fairer solutions than a centralised genetic algorithm that can make use of the private information of each processor. Depending on the number of processors, the solution quality found by the mechanism presented in this paper is competitive with or even better than that of the centralised genetic algorithm.