This paper studies the single machine scheduling problems with truncated logarithm processing times and exponential past-sequence-dependent delivery times. We prove that the makespan and total completion time minimizations are polynomially solvable. For the total weighted completion time minimization, we illustrate that it remains polynomially solvable under a special case; under the general case, this paper proposes heuristic, tabu search and branch-and-bound algorithms. Computational experiments indicate that the heuristic algorithm is more effective than tabu search algorithm.

中文翻译：

---

具有截断学习效果和指数过去序列相关交付时间的单机调度问题

本文研究了具有截断对数处理时间和指数过去序列相关交付时间的单机调度问题。我们证明了完工时间和总完成时间最小化是多项式可解的。对于总加权完成时间最小化，我们说明在特殊情况下它仍然是多项式可解的；在一般情况下，本文提出了启发式、禁忌搜索和分支定界算法。计算实验表明启发式算法比禁忌搜索算法更有效。