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

@article{Cheng2008MultiagentSO,
  title={Multi-agent scheduling on a single machine with max-form criteria},
  author={T. C. Edwin Cheng and C. T. Ng and J. J. Yuan},
  journal={European Journal of Operational Research},
  year={2008},
  volume={188},
  pages={603-609}
}
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… CONTINUE READING
Highly Cited
This paper has 97 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 48 extracted citations

98 Citations

01020'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 98 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…