We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A genetic iterated greedy algorithm for the blocking flowshop to minimize total earliness and tardiness.
- Authors
de Athayde Prata, Bruno; Fuchigami, Helio Yochihiro
- Abstract
An important and realistic class of scheduling problems is considered in this paper: the total earliness and tardiness minimization in the blocking flowshop, where there is no intermediate buffer between machines. Blocking occurs when a completed item or product remains on the machine until the next machine is available. We proposed a new hybrid evolutionary algorithm: the Genetic Iterated Greedy Algorithm (GIGA). In our innovative solution approach, a genetic algorithm presents a hybrid crossover based on the Iterated Greedy metaheuristic. The hybrid crossover considers the Hamming distance as an indicator of the diversity of the current population. In the first generations, the crossover will adopt larger values for the destruction parameter, and this value is gradually reduced throughout the search process. Our proposal is compared to four competitive metaheuristics reported for earliness and tardiness flowshop. Two performance indicators are considered: the Average Relative Percentage Deviation (ARPD) and the Success Rate (SR). Based on the statistical analysis of the computational experimentation, our GIGA outperformed all the implemented algorithms of the literature with statistical significance. Concerning the performance indicators, GIGA achieved ARPD = 0.02% and SR = 83.5%, pointing to the superiority of the proposed solution approach.
- Subjects
EVOLUTIONARY algorithms; TARDINESS; HAMMING distance; STATISTICS; SCHOOL schedules; METAHEURISTIC algorithms; GREEDY algorithms; GENETIC algorithms
- Publication
Journal of Intelligent Manufacturing, 2024, Vol 35, Issue 5, p2161
- ISSN
0956-5515
- Publication type
Article
- DOI
10.1007/s10845-023-02147-8