| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 480687 | European Journal of Operational Research | 2011 | 6 Pages |
Two agents, each having his own set of jobs, compete to perform their own jobs on a common processing resource. Each job of the agents has a weight that specifies its importance. The cost of the first agent is the maximum weighted completion time of his jobs while the cost of the second agent is the total weighted completion time of his jobs. We consider the scheduling problem of determining the sequence of the jobs such that the total cost of the two agents is minimized. We provide a 2-approximation algorithm for the problem, show that the case where the number of jobs of the first agent is fixed is NP-hard, and devise a polynomial time approximation scheme for this case.
► We consider a two-agent single-machine scheduling problem to minimize the total costs of the agents. ► The cost of the first agent is the maximum weighted completion time of his jobs and the cost of the second agent is the total weighted completion time of his jobs. ► We provide a 2-approximation algorithm for the problem. ► We show that the case where the number of jobs of the first agent is fixed is NP-hard. ► We devise a polynomial time approximation scheme for this case.
