What type of study is this?

September 5, 2025International Journal of Industrial Engineering ComputationsOpen Access

The distributed flow shop problem under carbon quota constraints

View Full Paper

Ask AI

Bookmark

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.

Discussion

No takes yet. Share an insight, caveat, or question.

Implication

This research proposes an iterative greedy algorithm for minimizing makespan with carbon quota constraints, highlighting efficiency improvements and dynamic speed adjustments.

Cite This Study

Li et al. (2025) studied this question.

synapsesocial.com/papers/68bb3a2b2b87ece8dc95485e https://doi.org/10.5267/j.ijiec.2025.6.006

View Full Paper

Ask AI

Bookmark

Implication

This research proposes an iterative greedy algorithm for minimizing makespan with carbon quota constraints, highlighting efficiency improvements and dynamic speed adjustments.

The distributed flow shop problem under carbon quota constraints

Key Points

Discussion

Implication

Cite This Study

The distributed flow shop problem under carbon quota constraints

Key Points

Discussion

Implication

Cite This Study

Also Consider

Also Consider