Two-agent scheduling problems on a single-machine to minimize the total weighted late work |
| |
Authors: | Zhang Xingong Wang Yong |
| |
Affiliation: | 1.College of Mathematics Science,Chongqing Normal University,Chongqing,China;2.College of Economics and Business Administration,Chongqing University,Chongqing,China |
| |
Abstract: | In this paper, two-agent scheduling problems are presented. The different agents share a common processing resource, and each agent wants to minimize a cost function depending on its jobs only. The objective functions we consider are the total weighted late work and the maximum cost. The problem is to find a schedule that minimizes the objective function of agent A, while keeping the objective function of agent B cannot exceed a given bound U. Some different scenarios are presented by depending on the objective function of each agent. We address the complexity of those problems, and present the optimal polynomial time algorithms or pseudo-polynomial time algorithm to solve the scheduling problems, respectively. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|