Approximation schemes for two-agent scheduling on parallel machines

Citations of this article
Mendeley users who have this article in their library.


Two models of two-agent scheduling problem on identical machines are considered in this paper. In both models, the goal is to minimize the makespan and the total completion time of agent A respectively, subject to an upper bound on the makespan of agent B. We prove that these two problems are NP-hard and can be solved in pseudo-polynomial time. Furthermore, we design the fully polynomial time approximation schemes for both problems, respectively. © 2012 Elsevier B.V. All rights reserved.




Zhao, K., & Lu, X. (2013). Approximation schemes for two-agent scheduling on parallel machines. Theoretical Computer Science, 468, 114–121.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free