This research proposes an iterative greedy algorithm for minimizing makespan with carbon quota constraints, highlighting efficiency improvements and dynamic speed adjustments.
Key Points
The proposed iterative greedy algorithm significantly reduces makespan while adhering to carbon quota constraints.
Initial solutions generated by the enhanced NEH algorithm lead to improved overall efficiency during scheduling.
The dynamic speed adjustment strategy ensures compliance with energy consumption limits throughout the scheduling process.
Performance evaluations across 720 instances confirmed the algorithm's effectiveness in complex scheduling challenges.