Multi-agent scheduling on a single machine with max-form criteria

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 t...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 188; no. 2; pp. 603 - 609
Main Authors Cheng, T.C.E., Ng, C.T., Yuan, J.J.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.07.2008
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Applied sciences
Exact sciences and technology
Fixed jobs
Multi-agent
Operational research. Management science
Production scheduling
Scheduling
Stochastic models
Studies
Multi-agent
Fixed jobs
Scheduling
Multiagent system
NP hard problem
Feasibility
Objective function
Modeling
Single machine
Polynomial time
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.04.040