2015
DOI: 10.1007/s00500-015-1817-z
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: This paper considers a two-agent scheduling problem with arbitrary release dates on a single machine. The cost of the first agent is the maximum weighted completion time of its jobs while the cost of the second agent is the total weighted completion time of its jobs. The goal is to schedule the jobs such that the total cost of the two agents is minimized. The problem is known to be strongly NP-hard. Thus, as an alternative, a branch-and-bound algorithm incorporating several dominance properties and a lower bou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 44 publications
0
2
0
Order By: Relevance
“…At the beginning of multi-agent scheduling, only two competing agents were considered. Even so, most of such problems are NP-hard (e.g., [5,49,56]). Consequently, the issues of two-agent scheduling have been widely and thoroughly discussed for decades.…”
Section: Introductionmentioning
confidence: 99%
“…At the beginning of multi-agent scheduling, only two competing agents were considered. Even so, most of such problems are NP-hard (e.g., [5,49,56]). Consequently, the issues of two-agent scheduling have been widely and thoroughly discussed for decades.…”
Section: Introductionmentioning
confidence: 99%
“…This problem aimed to minimize the objective of one agent under the constraint that the objective of another agent was below or at a fixed threshold value. For the combination optimization model, Wang et al [19] and Liu and Gu [14] also researched a two-agent scheduling problem with release time on a single machine but they would like to find a schedule to minimize the total cost of both two agents. Many researchers also considered the special and important two-agent problems, including Elvikis and Kindt [5], Gerstl and Mosheiov [6,7],…”
mentioning
confidence: 99%