Single-machine scheduling simultaneous consideration of resource allocations and exponential time-dependent learning effects
研究了单机环境下考虑指数时间依赖学习效应的凸资源分配调度问题，提出了双目标模型，分别优化最大完工时间和资源消耗成本，并针对不同情形设计了多项式时间算法、启发式算法、模拟退火算法和分支定界算法。
This study addresses convex resource allocation scheduling problems with exponential time-dependent learning effects. Under a single-machine, a bicriteria scheduling model is introduced where the first criterion is to minimize makespan, and the other is to minimize resource consumption cost. For some special cases, polynomial time algorithms are developed for three versions of considering the two costs. For the general case of the three versions of these two costs, we present a heuristic algorithm, a simulated annealing (SA), and a branch and bound algorithm to solve the problem.