Abstract In this paper, we consider the single machine scheduling problem with release times and a learning effect. The actual processing time of a job is a function that is the total processing time of the jobs already processed. The objective is to minimize the weighted sum of makespan, total completion time and maximum tardiness. This problem is NP-hard, some heuristic algorithms and branch-and-bound algorithm based on the Depth-first Search algorithm are proposed to solve the problem. Computational experiments are conducted to evaluate the performance of the heuristic and branch-and-bound algorithms.

中文翻译：

---

具有发布时间和学习因子的三准则单机调度模型

摘要 在本文中，我们考虑具有释放时间和学习效果的单机调度问题。作业的实际处理时间是一个函数，它是已处理作业的总处理时间。目标是最小化完工时间、总完工时间和最大延误的加权总和。该问题是NP-hard问题，提出了一些基于深度优先搜索算法的启发式算法和分支定界算法来解决该问题。进行计算实验以评估启发式和分支定界算法的性能。