Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/646
Title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Authors: Cheng, TCE 
Ng, CTD 
Yuan, JJ
Keywords: Scheduling
Multi-agent deterministic sequencing
Issue Date: 11-Oct-2006
Publisher: Elsevier B.V.
Source: Theoretical computer science, 11 Oct. 2006, v. 362, no. 1-3, p. 273-281 How to cite?
Journal: Theoretical computer science 
Abstract: We consider the feasibility model of multi-agent scheduling on a single machine, where each agent's objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial time for unit weights; then we present a fully polynomial-time approximation scheme for the problem.
URI: http://hdl.handle.net/10397/646
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.07.011
Rights: Theoretical Computer Science © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
sum-mu(Multi-Agents) final.pdfPre-published version154.24 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

117
Last Week
0
Last month
3
Citations as of May 28, 2016

WEB OF SCIENCETM
Citations

106
Last Week
0
Last month
2
Citations as of Dec 6, 2016

Page view(s)

389
Last Week
5
Last month
Checked on Dec 4, 2016

Download(s)

559
Checked on Dec 4, 2016

Google ScholarTM

Check

Altmetric



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