@inproceedings{08ce74d0da2a4479912fedca6e4f5a7c,
title = "Autonomous scheduling with unbounded and bounded agents",
abstract = "Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their tasks, the individual schedules always can be merged into a global feasible schedule? Unlike the traditional approaches to distributed scheduling we do not enforce a fixed schedule to every participating agent. Instead we guarantee flexibility by offering a set of schedules to choose from in such a way that every agent can choose its own schedule independently from the others. We show that in case of agents with unbounded concurrency, optimal make-span can be guaranteed. Whenever the agents have bounded concurrency optimality cannot be guaranteed, but we present an approximation algorithm that ensures a constant make-span ratio",
author = "Ch. Yadati and C. Witteveen and Yingqian Zhang and M. Wu and \{Poutr{\'e}, La\}, J.A.",
year = "2008",
doi = "10.1007/978-3-540-87805-6\_18",
language = "English",
isbn = "978-3-540-87804-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "195--206",
editor = "R. Bergmann and G. Lindemann and S. Kirn and M. Pechoucek",
booktitle = "Multiagent system technologies : 6th German conference, MATES 2008 : Kaiserslautern, Germany, September 23-26, 2008 : proceedings",
address = "Germany",
note = "conference; Multiagent system technologies : 6th German conference, MATES 2008; 2008-09-23; 2008-09-26 ; Conference date: 23-09-2008 Through 26-09-2008",
}