Scheduling Problems with Two Competing Agents

Allesandro Agnetis (), Pitu B. Mirchandani (), Dario Pacciarelli () and Andrea Pacifici ()
Additional contact information
Allesandro Agnetis: Dipartimento di Ingegneria dell'Informazione, Universitaà di Siena, via Roma 56, 53100 Siena, Italy
Pitu B. Mirchandani: Department of Systems and Industrial Engineering, The University of Arizona, Tucson, Arizona 85721
Dario Pacciarelli: Dipartimento di Informatica e Automazione, Università Roma Tre, Rome, Italy
Andrea Pacifici: Dipartimento di Informatica, Sistemi e Produzione and Centro Vito Volterra, Università di Roma “Tor Vergata,” Rome, Italy

Operations Research, 2004, vol. 52, issue 2, 229-242

Abstract: We consider the scheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion times of its jobs only. The objective functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs, and total weighted completion times. We obtain different scenarios, depending on the objective function of each agent, and on the structure of the processing system (single machine or shop). For each scenario, we address the complexity of various problems, namely, finding the optimal solution for one agent with a constraint on the other agent's cost function, finding single nondominated schedules (i.e., such that a better schedule for one of the two agents necessarily results in a worse schedule for the other agent), and generating all nondominated schedules.

Keywords: production/scheduling: multiagent deterministic sequencing; games/group decisions: cooperative sequencing (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (99)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1030.0092 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:52:y:2004:i:2:p:229-242

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().