Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1154
Title: | Multi-agent scheduling on a single machine with max-form criteria | Authors: | Cheng, TCE Ng, CTD Yuan, JJ |
Issue Date: | Jul-2008 | Source: | European journal of operational research, 16 July 2008, v. 188, no. 2, p. 603-609 | Abstract: | We consider multi-agent scheduling on a single machine, where the objective functions of the agents are of the max-form. For the feasibility model, we show that the problem can be solved in polynomial time even when the jobs are subject to precedence restrictions. For the minimality model, we show that the problem is strongly NP-hard in general, but can be solved in pseudo-polynomial-time when the number of agents is a given constant. We then identify some special cases of the minimality model that can be solved in polynomial-time. | Keywords: | Scheduling Multi-agent Fixed jobs |
Publisher: | Elsevier | Journal: | European journal of operational research | ISSN: | 0377-2217 | EISSN: | 1872-6860 | DOI: | 10.1016/j.ejor.2007.04.040 | Rights: | European Journal of Operational Research © 2007 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 | Size | Format | |
---|---|---|---|---|
(Revised)Max-Form(Multi-Agents)-SC.pdf | Pre-published version | 142.02 kB | Adobe PDF | View/Open |
Page views
159
Last Week
1
1
Last month
Citations as of Apr 28, 2024
Downloads
325
Citations as of Apr 28, 2024
SCOPUSTM
Citations
150
Last Week
0
0
Last month
2
2
Citations as of May 3, 2024
WEB OF SCIENCETM
Citations
138
Last Week
1
1
Last month
1
1
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.