中文摘要：

研究了带有简单线性恶化工件和释放时间的两个代理单机调度问题.所有工件在一台机器上加工,每个代理有各自依赖于自己工件的优化目标.针对工件释放时间相同与不同两种情况,研究了有约束的优化模型,即找到调度最小化一个代理的目标函数而使得另一个代理的目标函数不超过一个给定的上界.当工件具有相同的释放时间,我们主要考虑的目标函数有：总加权完工时间和总加权拖期工件数.当工件具有不同释放时间,我们考虑的目标函数有：最大完工时间、总完工时间以及拖期工件数.对于每一个问题,我们分析了问题的计算复杂性.此外,对于NP难问题的一些特殊情况本文分析了最优解性质,基于这些性质给出了最优算法。

英文摘要：

In this paper, we investigate the two-agent single-machine scheduling problem with simple linear-deteriorating jobs and release dates. All the jobs are processed on a common machine, and each agent has respective criterion depending on its own jobs to optimize. In view of identical or different job release dates, the constrained optimization model is studied,which is to schedule the jobs such that the objective of one agent is minimized while the objective of the other agent is less than a given upper bound. For the jobs with identical release dates, the objectives we consider in this paper are total weighted completion times and total weighted number of tardy jobs. For the jobs with distinct release dates, the objectives we consider are makespan, total completion times, and number of tardy jobs. For each problem, we analyze the computational complexity. Moreover, for several special cases of NP-hard problems, we present optimal properties and provide optimal algorithms on the basis of these properties.