Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/646
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorNg, CTD-
dc.creatorYuan, JJ-
dc.date.accessioned2014-12-11T08:27:38Z-
dc.date.available2014-12-11T08:27:38Z-
dc.identifier.issn0304-3975-
dc.identifier.urihttp://hdl.handle.net/10397/646-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsTheoretical Computer Science © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectMulti-agent deterministic sequencingen_US
dc.titleMulti-agent scheduling on a single machine to minimize total weighted number of tardy jobsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage273-
dc.identifier.epage281-
dc.identifier.volume362-
dc.identifier.issue1-3-
dc.identifier.doi10.1016/j.tcs.2006.07.011-
dcterms.abstractWe 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationTheoretical computer science, 11 Oct. 2006, v. 362, no. 1-3, p. 273-281-
dcterms.isPartOfTheoretical computer science-
dcterms.issued2006-10-11-
dc.identifier.isiWOS:000241117900020-
dc.identifier.scopus2-s2.0-33748545910-
dc.identifier.rosgroupidr32319-
dc.description.ros2006-2007 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
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
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

225
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

223
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

191
Last Week
0
Last month
3
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

172
Last Week
0
Last month
2
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


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