Variable iterated greedy for energy-efficient hybrid flow shop scheduling problem with blocking constraint

View Full Paper

Ask AI

Bookmark

Authors

Discussion

Novel variable neighborhood search approaches minimize energy consumption in hybrid flow-shop scheduling, indicating enhanced efficiency.

The proposed VIG algorithm lowers average objective values by achieving 106729.07 in simulations involving 480 instances.
Simulation results indicate a performance improvement of up to 13.3% compared to seven established algorithms in this field.
By applying tailored variable neighborhood search, this research effectively reduces setup and blocking times during job sequencing.
The study's mixed-integer linear programming model promotes machine turn-on/off strategies to enhance sustainability in manufacturing.

Liu et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark