Constructive-destructive neighbor search drives artificial bee colony algorithm for variable speed green hybrid flowshop scheduling problem DOI Creative Commons
Danying Hu, Yali Wu, Lei Qiu

et al.

Scientific Reports, Journal Year: 2025, Volume and Issue: 15(1)

Published: March 20, 2025

The hybrid flowshop scheduling problem (HFSP), a typical NP-hard problem, has gained significant interest from researchers focusing on the development of solution methods. We focus variable speed problem. assume that machines operate at when processing workpieces, making more reflective real-world scenarios. Aiming this optimization strategy for encoding and decoding is proposed. Meanwhile, we design constructive-destructive search driven artificial bee colony algorithm to solve variable-speed green flow shop minimize makespan total energy consumption. A neighbor method designed update population in employed phase. process redesigned with three operators named technique order preferences similarity ideal solutions, binary tournament selection, global strategies onlooker In scout phase, individual evaluation replacement are designed. Extensive experimental evaluations testify CDSABC outperforms other algorithms regarding best, worst, average, standard deviation IGD index 80% test cases.

Language: Английский

Enhancing distributed blocking flowshop group scheduling: Theoretical insight and application of an iterated greedy algorithm with idle time insertion and rapid evaluation mechanisms DOI

Yizheng Wang,

Yuting Wang, Yuyan Han

et al.

Expert Systems with Applications, Journal Year: 2025, Volume and Issue: unknown, P. 126600 - 126600

Published: Jan. 1, 2025

Language: Английский

Citations

1
A Q-learning-driven genetic algorithm for the distributed hybrid flow shop group scheduling problem with delivery time windows DOI

Qianhui Ji,

Yuyan Han, Yuting Wang

et al.

Information Sciences, Journal Year: 2025, Volume and Issue: unknown, P. 121971 - 121971

Published: Feb. 1, 2025

Language: Английский

Citations

0
Constructive-destructive neighbor search drives artificial bee colony algorithm for variable speed green hybrid flowshop scheduling problem DOI Creative Commons
Danying Hu, Yali Wu, Lei Qiu

et al.

Scientific Reports, Journal Year: 2025, Volume and Issue: 15(1)

Published: March 20, 2025

The hybrid flowshop scheduling problem (HFSP), a typical NP-hard problem, has gained significant interest from researchers focusing on the development of solution methods. We focus variable speed problem. assume that machines operate at when processing workpieces, making more reflective real-world scenarios. Aiming this optimization strategy for encoding and decoding is proposed. Meanwhile, we design constructive-destructive search driven artificial bee colony algorithm to solve variable-speed green flow shop minimize makespan total energy consumption. A neighbor method designed update population in employed phase. process redesigned with three operators named technique order preferences similarity ideal solutions, binary tournament selection, global strategies onlooker In scout phase, individual evaluation replacement are designed. Extensive experimental evaluations testify CDSABC outperforms other algorithms regarding best, worst, average, standard deviation IGD index 80% test cases.

Language: Английский

Citations

0