Autonomous scheduling with unbounded and bounded agents

Ch. Yadati, C. Witteveen, Yingqian Zhang, M. Wu, J.A. Poutré, La

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

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
Original languageEnglish
Title of host publicationMultiagent system technologies : 6th German conference, MATES 2008 : Kaiserslautern, Germany, September 23-26, 2008 : proceedings
EditorsR. Bergmann, G. Lindemann, S. Kirn, M. Pechoucek
Place of PublicationBerlin
PublisherSpringer
Pages195-206
ISBN (Print)978-3-540-87804-9
DOIs
Publication statusPublished - 2008
Eventconference; Multiagent system technologies : 6th German conference, MATES 2008; 2008-09-23; 2008-09-26 -
Duration: 23 Sep 200826 Sep 2008

Publication series

NameLecture Notes in Computer Science
Volume5244
ISSN (Print)0302-9743

Conference

Conferenceconference; Multiagent system technologies : 6th German conference, MATES 2008; 2008-09-23; 2008-09-26
Period23/09/0826/09/08
OtherMultiagent system technologies : 6th German conference, MATES 2008

Fingerprint Dive into the research topics of 'Autonomous scheduling with unbounded and bounded agents'. Together they form a unique fingerprint.

Cite this