Multi-agent single machine scheduling
Alessandro Agnetis (),
Dario Pacciarelli () and
Andrea Pacifici ()
Annals of Operations Research, 2007, vol. 150, issue 1, 3-15
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs and total weighted completion time. The different combinations of the cost functions of each agent lead to various problems, whose computational complexity is analysed in this paper. In particular, we investigate the problem of finding schedules whose cost for each agent does not exceed a given bound for each agent. Copyright Springer Science+Business Media, LLC 2007
Keywords: Multi-agent; Scheduling; Complexity; Multi-criteria (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:150:y:2007:i:1:p:3-15:10.1007/s10479-006-0164-y
Ordering information: This journal article can be ordered from
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla ().