中文摘要：

研究了单台机器上工件具有可退化效应并考虑工件运输的在线排序问题.工件按时间在线到达.这些工件先在机器上加工,完工的工件再由一台运输车辆将其运送给顾客.排序问题的目标是最小化最大运输完工时间.对于所讨论的排序模型,给出了问题的下界并给出达到下界的最好可能的在线算法.

英文摘要：

The online scheduling on a single machine with deteriorating jobs and job delivery was considered. The jobs arrive over time. The jobs were first processed on the single machine, and then the completed jobs were delivered by a vehicle to some customers. The objective was to minimize the maximum delivery completion time of the jobs. For the given problem, a lower bound was given and the best possible online algorithm was established.