Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs

Long Wan, Jiajie Mei and Jiangze Du

European Journal of Operational Research, 2021, vol. 290, issue 1, 26-35

Abstract: In this paper, we revisit a two-agent scheduling problem on a single machine with jobs of unit processing times. In this problem, we have two agents: agent A and agent B. Each agent has his/her own disjoint job set. The objective of agent A is to minimize the total weighted completion time, and the objective of agent B is to minimize the total weighted number of tardy jobs. The complexity of the decision version of the problem was proposed as open in Oron et al. (European Journal of Operational Research 244:86–99, 2015). We construct a reduction from a variant of Even-Odd Partition to show that this problem is NP-complete. Finally, we also propose a pseudo-polynomial algorithm and a dual FPTAS for the problem.

Keywords: Two-agent scheduling; Completion time; Tardy job; NP-completeness; FPTAS (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221720306901
Full text for ScienceDirect subscribers only

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:eee:ejores:v:290:y:2021:i:1:p:26-35

DOI: 10.1016/j.ejor.2020.07.064

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().