中文摘要：

研究带有时间相关的学习效应和恶化工件的双代理单机调度问题，目的是找到一个调度使得满足第二个代理的最大完工时间不超过一个给定的上界的约束下，第一个代理的总完工时间最小．对于该调度问题，给出了一些最优性质，并提出了多项式时间最优算法．

英文摘要：

This paper investigates the two-agent single-machine scheduling problem with a time-dependent learning effect and deteriorating jobs. The objective is to minimize the total completion time of the first agent with the restriction that the makespan of the second agent does not exceed a given upper bound. The optimal properties are given, and the optimal polynomial time algorithm is presented to solve the scheduling problem.