Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Energy-efficient optimization for distributed blocking hybrid flowshop scheduling: a self-regulating iterative greedy algorithm under makespan constraint
This paper investigates an energy-efficient distributed blocking hybrid flowshop scheduling problem, constrained by the makespan upper-bound criterion. This problem is an extension of the distributed hybrid flowshop scheduling problem and closely resembles practical production scenarios, denoted as DHFmblockεTEC/Cmax. Initially, we formulate the issue into a mixed integer linear programming (MILP) model that reflects its unique characteristics and leverage the Gurobi solver for validation purposes. Building upon this groundwork, we develop a self-regulating iterative greedy (SIG) algorithm, designed to autonomously fine-tune its strategies and parameters in response to the quality of solutions derived during iterative processes. Within the SIG, we design a double-layer destruction-reconstruction, accompanied by a self-regulating variable neighborhood descent strategy, to facilitate the exploration of diverse search spaces and augment the global search capability of the algorithm. To evaluate the performance of the proposed algorithm, we implement an extensive series of simulation experiments. Based on the experimental result, the average total energy consumption and relative percentage increase obtained by SIG are 2.12 and 82% better than the four comparison algorithms, respectively. These statistics underscore SIG’s superior performance in addressing DHFmblockεTEC/Cmax compared to the other algorithms, thus offering a novel reference for decision-makers.
Energy-efficient optimization for distributed blocking hybrid flowshop scheduling: a self-regulating iterative greedy algorithm under makespan constraint
This paper investigates an energy-efficient distributed blocking hybrid flowshop scheduling problem, constrained by the makespan upper-bound criterion. This problem is an extension of the distributed hybrid flowshop scheduling problem and closely resembles practical production scenarios, denoted as DHFmblockεTEC/Cmax. Initially, we formulate the issue into a mixed integer linear programming (MILP) model that reflects its unique characteristics and leverage the Gurobi solver for validation purposes. Building upon this groundwork, we develop a self-regulating iterative greedy (SIG) algorithm, designed to autonomously fine-tune its strategies and parameters in response to the quality of solutions derived during iterative processes. Within the SIG, we design a double-layer destruction-reconstruction, accompanied by a self-regulating variable neighborhood descent strategy, to facilitate the exploration of diverse search spaces and augment the global search capability of the algorithm. To evaluate the performance of the proposed algorithm, we implement an extensive series of simulation experiments. Based on the experimental result, the average total energy consumption and relative percentage increase obtained by SIG are 2.12 and 82% better than the four comparison algorithms, respectively. These statistics underscore SIG’s superior performance in addressing DHFmblockεTEC/Cmax compared to the other algorithms, thus offering a novel reference for decision-makers.
Energy-efficient optimization for distributed blocking hybrid flowshop scheduling: a self-regulating iterative greedy algorithm under makespan constraint
Optim Eng
Wang, Yong (Autor:in) / Han, Yuyan (Autor:in) / Wang, Yuting (Autor:in) / Liu, Yiping (Autor:in)
Optimization and Engineering ; 26 ; 431-478
01.03.2025
48 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Minimizing the Makespan in Flowshop Scheduling for Sustainable Rubber Circular Manufacturing
| DOAJ | 2021
Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem
| Tema Archiv | 1993
| DOAJ | 2023