Exact algorithms for energy-constrained scheduling on identical parallel machines
研究了在单一可再生资源约束下，相同并行机上不可中断作业的调度问题，目标是最小化完工时间。提出了结合分支定界、先进定界技术和约束规划模型的精确算法，在基准测试集上优于现有方法。
We address the problem of scheduling non-preemptive jobs on identical parallel machines under a single renewable resource constraint, with the objective of minimizing the makespan. This setting captures relevant applications in energy-aware production planning, where energy usage must not exceed a fixed limit at any time. We introduce two mathematical formulations and propose an exact algorithm that integrates a branch-and-bound, advanced bounding techniques, and a constraint programming model. Extensive computational experiments on two benchmark sets from the literature show that the proposed approach outperforms existing exact methods, solving more instances to optimality and achieving consistently smaller optimality gaps within limited computation time.