Annals of Operations Research

, Volume 150, Issue 1, pp 3–15

Multi-agent single machine scheduling

Authors

    • Dipartimento di Ingegneria dell’InformazioneUniversità di Siena, Via Roma
  • Dario Pacciarelli
    • Dipartimento di Informatica e AutomazioneUniversità Roma Tre
  • Andrea Pacifici
    • Dipartimento di Ingegneria dell’Impresa and Centro Vito VolterraUniversità di Roma “Tor Vergata”
Article

DOI: 10.1007/s10479-006-0164-y

Cite this article as:
Agnetis, A., Pacciarelli, D. & Pacifici, A. Ann Oper Res (2007) 150: 3. doi:10.1007/s10479-006-0164-y

Abstract

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.

Keywords

Multi-agentSchedulingComplexityMulti-criteria

Copyright information

© Springer Science+Business Media, LLC 2006