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

• Published in: European 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
• Language: English
• Published: Amsterdam Elsevier B.V 16.07.2008; Elsevier; Elsevier Sequoia S.A
• Series: European 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

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