Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria

In this paper, we consider three preemptive Pareto-scheduling problems with two competing agents on a single machine. In each problem, the objective function of agent <i>A</i> is the total completion time, the maximum lateness, or the total late work while the objective function of agent...

Full description

Bibliographic Details
Main Authors:	Ruyan He, Jinjiang Yuan
Format:	Article
Language:	English
Published:	MDPI AG 2020-09-01
Series:	Mathematics
Subjects:	two-agent Pareto-scheduling late work trade-off curve polynomial time
Online Access:	https://www.mdpi.com/2227-7390/8/9/1517

id	doaj-d38d9d4f10e547ffaff15425c2f69412
record_format	Article
spelling	doaj-d38d9d4f10e547ffaff15425c2f694122020-11-25T03:25:46ZengMDPI AGMathematics2227-73902020-09-0181517151710.3390/math8091517Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other CriteriaRuyan He0Jinjiang Yuan1School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, ChinaSchool of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, ChinaIn this paper, we consider three preemptive Pareto-scheduling problems with two competing agents on a single machine. In each problem, the objective function of agent <i>A</i> is the total completion time, the maximum lateness, or the total late work while the objective function of agent <i>B</i> is the total late work. For each problem, we provide a polynomial-time algorithm to characterize the trade-off curve of all Pareto-optimal points.https://www.mdpi.com/2227-7390/8/9/1517two-agentPareto-schedulinglate worktrade-off curvepolynomial time
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Ruyan He Jinjiang Yuan
spellingShingle	Ruyan He Jinjiang Yuan Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria Mathematics two-agent Pareto-scheduling late work trade-off curve polynomial time
author_facet	Ruyan He Jinjiang Yuan
author_sort	Ruyan He
title	Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
title_short	Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
title_full	Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
title_fullStr	Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
title_full_unstemmed	Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria
title_sort	two-agent preemptive pareto-scheduling to minimize late work and other criteria
publisher	MDPI AG
series	Mathematics
issn	2227-7390
publishDate	2020-09-01
description	In this paper, we consider three preemptive Pareto-scheduling problems with two competing agents on a single machine. In each problem, the objective function of agent <i>A</i> is the total completion time, the maximum lateness, or the total late work while the objective function of agent <i>B</i> is the total late work. For each problem, we provide a polynomial-time algorithm to characterize the trade-off curve of all Pareto-optimal points.
topic	two-agent Pareto-scheduling late work trade-off curve polynomial time
url	https://www.mdpi.com/2227-7390/8/9/1517
work_keys_str_mv	AT ruyanhe twoagentpreemptiveparetoschedulingtominimizelateworkandothercriteria AT jinjiangyuan twoagentpreemptiveparetoschedulingtominimizelateworkandothercriteria
_version_	1724595855869083648

Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria

Similar Items