Competitive Two-Agent Scheduling and Its Applications
Competitive Two-Agent Scheduling and Its Applications
复制标题
DOI：
10.1287/opre.1090.0744
复制
发表时间：
2010-03-01
影响因子：
2.7
通讯作者：
Wan, Guohua
中科院分区：
文献类型：
--
作者：
Leung, Joseph Y. -T.;Pinedo, Michael;Wan, Guohua
我们考虑一个调度环境，m（m >= 1）相同的机器并行和两个代理。代理A负责n（1）个工作，并具有关于这些工作的给定目标函数;代理B负责n（2）个工作，并具有与代理A的目标函数相同或不同的目标函数。该问题是为n（1）+ n（2）个工件找到一个调度，该调度使代理A的目标（关于他的n（1）个工件）最小化，同时使代理B的目标（关于他的n（2）个工件）保持低于或处于固定水平Q。最近在文献中考虑了单机的特殊情况，并且对于目标函数为f（max），Sigma w（j）C（j）和Sigma U-j的两智能体模型得到了各种结果，本文推广了这些结果并解决了其中一个尚未解决的问题.此外，我们扩大了两个代理调度问题的框架，包括总延误目标，允许抢占，并考虑不同的发布日期的工作，我们也认为相同的机器并行。我们还建立了两个代理调度问题和调度领域内的其他领域，即重新调度和调度的可用性约束之间的关系。
We consider a scheduling environment with m (m >= 1) identical machines in parallel and two agents. Agent A is responsible for n(1) jobs and has a given objective function with regard to these jobs; agent B is responsible for n(2) jobs and has an objective function that may be either the same or different from the one of agent A. The problem is to find a schedule for the n(1) + n(2) jobs that minimizes the objective of agent A (with regard to his n(1) jobs) while keeping the objective of agent B (with regard to his n(2) jobs) below or at a fixed level Q. The special case with a single machine has recently been considered in the literature, and a variety of results have been obtained for two-agent models with objectives such as f(max), Sigma w(j)C(j), and Sigma U-j. In this paper, we generalize these results and solve one of the problems that had remained open. Furthermore, we enlarge the framework for the two-agent scheduling problem by including the total tardiness objective, allowing for preemptions, and considering jobs with different release dates; we consider also identical machines in parallel. We furthermore establish the relationships between two-agent scheduling problems and other areas within the scheduling field, namely rescheduling and scheduling subject to availability constraints.