Please use this identifier to cite or link to this item:
Title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Authors: Cheng, T. C. Edwin
Ng, Chi-to Daniel
Yuan, J. J.
Subjects: 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.
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.
Rights: Theoretical Computer Science © 2006 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.tcs.2006.07.011
ISSN: 0304-3975
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
sum-mu(Multi-Agents) final.pdfPre-published version154.24 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.