A note on the complexity of the problem of two-agent scheduling on a single machine

C. T. Ng, T. C. E. Cheng and J. J. Yuan
Additional contact information
C. T. Ng: The Hong Kong Polytechnic University, Hung Hom
T. C. E. Cheng: The Hong Kong Polytechnic University, Hung Hom
J. J. Yuan: Zhengzhou University

Journal of Combinatorial Optimization, 2006, vol. 12, issue 4, No 6, 387-394

Abstract: Abstract We consider a two-agent scheduling problem on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the number of tardy jobs of the second agent cannot exceed a given number. It is reported in the literature that the complexity of this problem is still open. We show in this paper that this problem is NP-hard under high multiplicity encoding and can be solved in pseudo-polynomial time under binary encoding. When the first agent's objective is to minimize the total weighted completion time, we show that the problem is strongly NP-hard even when the number of tardy jobs of the second agent is restricted to be zero.

Keywords: Production/scheduling; Multi-agent deterministic sequencing; Games/group decisions; Cooperative sequencing (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-9001-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:12:y:2006:i:4:d:10.1007_s10878-006-9001-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-9001-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().