Annals of Operations Research

, Volume 150, Issue 1, pp 3-15

First online:

Multi-agent single machine scheduling

  • Alessandro AgnetisAffiliated withDipartimento di Ingegneria dell’Informazione, Università di Siena, Via Roma Email author 
  • , Dario PacciarelliAffiliated withDipartimento di Informatica e Automazione, Università Roma Tre
  • , Andrea PacificiAffiliated withDipartimento di Ingegneria dell’Impresa and Centro Vito Volterra, Università di Roma “Tor Vergata”

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.


Multi-agent Scheduling Complexity Multi-criteria