Innovative Optimization Algorithms for Large-Sized Industrial Scheduling Problems DOI Creative Commons
Hélio Yochihiro Fuchigami, ALEX PARANAHYBA DE ABREU

Brazilian Archives of Biology and Technology, Journal Year: 2024, Volume and Issue: 67

Published: Jan. 1, 2024

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 systematic review of permutation flow shop scheduling with due-date-related objectives DOI
Bruno de Athayde Prata, Levi Ribeiro de Abreu, Victor Fernández-Viagas

et al.

Computers & Operations Research, Journal Year: 2025, Volume and Issue: unknown, P. 106989 - 106989

Published: Jan. 1, 2025

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

Citations

0
A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows DOI Creative Commons

Qianhui Ji,

Yuyan Han, Yuting Wang

et al.

Complex System Modeling and Simulation, Journal Year: 2024, Volume and Issue: 4(2), P. 137 - 165

Published: June 1, 2024

The hybrid flow shop group scheduling problem (HFGSP) with the delivery time windows has been widely studied owing to its better flexibility and suitability for current just-in-time production mode. However, there are several unresolved challenges in modeling algorithmic design tailored HFGSP. In our study, we place emphasis on constraint of timeliness. Therefore, this paper first constructs a mixed integer linear programming model HFGSP sequence-dependent setup minimize total weighted earliness tardiness (TWET). Then penalty groups-assisted iterated greedy integrating idle insertion (PG_IG_ITI) is proposed solve above problem. PG_IG_ITI, double decoding strategy based earliest available machine rule calculate TWET value. Subsequently, reduce amount computation, skip-based destruction reconstruction designed, local search further improve quality solution by disturbing penalized groups, i.e., early tardy groups. Finally, through comprehensive statistical experiments 270 test instances, results prove that algorithm effective compared four state-of-the-art algorithms.

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

Citations

3
The constrained permutation Flowshop problem: An effective two-stage iterated greedy algorithm to minimize weighted tardiness DOI
Qiuying Li,

Quan-Ke Pan,

Liang Gao

et al.

Swarm and Evolutionary Computation, Journal Year: 2024, Volume and Issue: 91, P. 101696 - 101696

Published: Aug. 18, 2024

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

Citations

2
A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness DOI Open Access
Bruno de Athayde Prata, Levi Ribeiro de Abreu, Marcelo Seido Nagano

et al.

Journal of Industrial and Management Optimization, Journal Year: 2024, Volume and Issue: 20(10), P. 3089 - 3108

Published: Jan. 1, 2024

This paper addresses a no-wait flowshop scheduling problem with total tardiness minimization. We present mixed-integer linear programming formulation positional decision variables and new constraint model to solve the as exact approaches. As an alternative solution procedure, we develop innovative Reactive Iterated Greedy (RIG) algorithm that presents dynamic mechanism adjust number of jobs be removed from current permutation in destruction phase. carried out computational experiments on set 800 test instances available literature evaluate performance proposed RIG comparison five approaches (Mixed-Integer Linear Programming, Constraint Block Simulated Annealing, Variable Neighborhood Descent, Greedy). The used criterion is Relative Deviation Index (RDI). returned average RDI 5.0%, representing best results among procedures under comparison. Computational pointed our proposal outperformed mathematical other metaheuristics statistical significance.

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

Citations

1
Distributed hybrid flowshop scheduling with consistent sublots under delivery time windows: A penalty lot-assisted iterated greedy algorithm DOI Creative Commons
Jinli Liu, Yuyan Han, Yuting Wang

et al.

Egyptian Informatics Journal, Journal Year: 2024, Volume and Issue: 28, P. 100566 - 100566

Published: Nov. 11, 2024

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

Citations

1
The cascaded flowshop joint scheduling problem: A mathematical model and population-based iterated greedy algorithm to minimize total tardiness DOI

Chuang Wang,

Quan-Ke Pan, Hongyan Sang

et al.

Robotics and Computer-Integrated Manufacturing, Journal Year: 2024, Volume and Issue: 88, P. 102747 - 102747

Published: March 2, 2024

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

Citations

0
Innovative Optimization Algorithms for Large-Sized Industrial Scheduling Problems DOI Creative Commons
Hélio Yochihiro Fuchigami, ALEX PARANAHYBA DE ABREU

Brazilian Archives of Biology and Technology, Journal Year: 2024, Volume and Issue: 67

Published: Jan. 1, 2024

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

Citations

0