Scheduling problems with two competing agents

Allesandro Agnetis, Pitu Mirchandani, Dario Pacciarelli, Andrea Pacifici

Research output: Contribution to journalArticle

285 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)229-242
Number of pages14
JournalOperations Research
Volume52
Issue number2
DOIs
StatePublished - Mar 2004
Externally publishedYes

Fingerprint

Scheduling
Processing
Cost functions
Schedule
Objective function
Scenarios

Keywords

  • Games/group decisions: cooperative sequencing
  • Production/scheduling: multiagent deterministic sequencing

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Scheduling problems with two competing agents. / Agnetis, Allesandro; Mirchandani, Pitu; Pacciarelli, Dario; Pacifici, Andrea.

In: Operations Research, Vol. 52, No. 2, 03.2004, p. 229-242.

Research output: Contribution to journalArticle

Agnetis, A, Mirchandani, P, Pacciarelli, D & Pacifici, A 2004, 'Scheduling problems with two competing agents', Operations Research, vol. 52, no. 2, pp. 229-242. https://doi.org/10.1287/opre.1030.0092
Agnetis, Allesandro ; Mirchandani, Pitu ; Pacciarelli, Dario ; Pacifici, Andrea. / Scheduling problems with two competing agents. In: Operations Research. 2004 ; Vol. 52, No. 2. pp. 229-242.
@article{42779846c9c249a5a5e01055c4377ea8,
title = "Scheduling problems with two competing agents",
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 = "Games/group decisions: cooperative sequencing, Production/scheduling: multiagent deterministic sequencing",
author = "Allesandro Agnetis and Pitu Mirchandani and Dario Pacciarelli and Andrea Pacifici",
year = "2004",
month = "3",
doi = "10.1287/opre.1030.0092",
language = "English (US)",
volume = "52",
pages = "229--242",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

TY - JOUR

T1 - Scheduling problems with two competing agents

AU - Agnetis, Allesandro

AU - Mirchandani, Pitu

AU - Pacciarelli, Dario

AU - Pacifici, Andrea

PY - 2004/3

Y1 - 2004/3

N2 - 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.

AB - 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.

KW - Games/group decisions: cooperative sequencing

KW - Production/scheduling: multiagent deterministic sequencing

UR - http://www.scopus.com/inward/record.url?scp=10844277375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10844277375&partnerID=8YFLogxK

U2 - 10.1287/opre.1030.0092

DO - 10.1287/opre.1030.0092

M3 - Article

VL - 52

SP - 229

EP - 242

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 2

ER -