Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34366
Title: A note on the complexity of the problem of two-agent scheduling on a single machine
Authors: Ng, CT 
Cheng, TCE 
Yuan, JJ
Keywords: Cooperative sequencing
Games/group decisions
Multi-agent deterministic sequencing
Production/scheduling
Issue Date: 2006
Source: Journal of combinatorial optimization, 2006, v. 12, no. 4, p. 386-393 How to cite?
Journal: Journal of Combinatorial Optimization 
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.
URI: http://hdl.handle.net/10397/34366
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9001-0
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

100
Last Week
0
Last month
2
Citations as of Aug 12, 2017

WEB OF SCIENCETM
Citations

64
Last Week
0
Last month
3
Citations as of Aug 12, 2017

Page view(s)

63
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.