A note on competing-agent Pareto-scheduling

Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C.E. Cheng

Research output: Journal article publication › Journal article › Academic research › peer-review

Abstract

We consider Pareto-scheduling with two competing agents A and B on a single machine, in which each job has a positional due index and a deadline. The jobs of agents A and B are called the A-jobs and B-jobs, respectively, where the A-jobs have a common processing time, while the B-jobs are restricted by their precedence constraint. The objective is to minimize a general sum-form objective function of the A-jobs and a general max-form objective function of the B-jobs, where all the objective functions are regular. We show that the problem is polynomially solvable.

Original language	English
Pages (from-to)	249-262
Number of pages	14
Journal	Optimization Letters
Volume	15
Issue number	1
DOIs	https://doi.org/10.1007/s11590-020-01576-1
Publication status	Published - Feb 2021

Keywords

Competing agents
Deadline
Pareto-scheduling
positional due indices
Precedence constraint

ASJC Scopus subject areas

Control and Optimization

More information

10.1007/s11590-020-01576-1

http://hdl.handle.net/10397/94214

Cite this

@article{45ae296fcbfd4b1b8b1553db763a885b,

title = "A note on competing-agent Pareto-scheduling",

abstract = "We consider Pareto-scheduling with two competing agents A and B on a single machine, in which each job has a positional due index and a deadline. The jobs of agents A and B are called the A-jobs and B-jobs, respectively, where the A-jobs have a common processing time, while the B-jobs are restricted by their precedence constraint. The objective is to minimize a general sum-form objective function of the A-jobs and a general max-form objective function of the B-jobs, where all the objective functions are regular. We show that the problem is polynomially solvable.",

keywords = "Competing agents, Deadline, Pareto-scheduling, positional due indices, Precedence constraint",

author = "Yuan Gao and Jinjiang Yuan and Ng, {C. T.} and Cheng, {T. C.E.}",

year = "2021",

month = feb,

doi = "10.1007/s11590-020-01576-1",

language = "English",

volume = "15",

pages = "249--262",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - A note on competing-agent Pareto-scheduling

AU - Gao, Yuan

AU - Yuan, Jinjiang

AU - Ng, C. T.

AU - Cheng, T. C.E.

PY - 2021/2

Y1 - 2021/2

N2 - We consider Pareto-scheduling with two competing agents A and B on a single machine, in which each job has a positional due index and a deadline. The jobs of agents A and B are called the A-jobs and B-jobs, respectively, where the A-jobs have a common processing time, while the B-jobs are restricted by their precedence constraint. The objective is to minimize a general sum-form objective function of the A-jobs and a general max-form objective function of the B-jobs, where all the objective functions are regular. We show that the problem is polynomially solvable.

AB - We consider Pareto-scheduling with two competing agents A and B on a single machine, in which each job has a positional due index and a deadline. The jobs of agents A and B are called the A-jobs and B-jobs, respectively, where the A-jobs have a common processing time, while the B-jobs are restricted by their precedence constraint. The objective is to minimize a general sum-form objective function of the A-jobs and a general max-form objective function of the B-jobs, where all the objective functions are regular. We show that the problem is polynomially solvable.

KW - Competing agents

KW - Deadline

KW - Pareto-scheduling

KW - positional due indices

KW - Precedence constraint

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

U2 - 10.1007/s11590-020-01576-1

DO - 10.1007/s11590-020-01576-1

M3 - Journal article

AN - SCOPUS:85082940716

SN - 1862-4472

VL - 15

SP - 249

EP - 262

JO - Optimization Letters

JF - Optimization Letters

IS - 1

ER -