Single machine scheduling with two competing agents, arbitrary release dates and unit processing times

Omri Dover () and Dvir Shabtay ()

Annals of Operations Research, 2016, vol. 238, issue 1, 145-178

Abstract: We study various single machine scheduling problems with two competing agents, unit processing times and arbitrary integer release dates. The problems differ by the scheduling criterion used by each of the two agents, and by the variant of the bicriteria problem that has to be solved. We prove that when the scheduling criterion of either one of the two agents is of a max-type, then all considered variants of the bicriteria problem are solvable in polynomial time. However, when the two agents have a sum-type of scheduling criterion, several variants of the bicriteria problem become $$\mathcal {NP}$$ NP -hard. Copyright Springer Science+Business Media New York 2016

Keywords: Single machine scheduling; Two competing agents; Arbitrary release dates; Unit processing times; $$\mathcal {NP}$$ NP -hard (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-2054-7 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:238:y:2016:i:1:p:145-178:10.1007/s10479-015-2054-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2054-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().