[HTML][HTML] A hybrid genetic algorithm and tabu search for minimizing makespan in flow shop scheduling problem
MS Umam, M Mustafid, S Suryono - … of King Saud University-Computer and …, 2022 - Elsevier
This paper combines the tabu search process with a genetic algorithm by employing a new
partial opposed-based as the population initialization technique to minimize makespan …
partial opposed-based as the population initialization technique to minimize makespan …
A two-stage cooperative evolutionary algorithm for energy-efficient distributed group blocking flow shop with setup carryover in precast systems
W Niu, J Li - Knowledge-Based Systems, 2022 - Elsevier
As the main link of the rapidly developing prefabricated construction industry, the production
of precast components (PCs) has become a research hotspot. Therefore, the distributed …
of precast components (PCs) has become a research hotspot. Therefore, the distributed …
Solving Permutation Flow Shop Scheduling Problem with Sequence‐Independent Setup Time
In this paper, we study the resolution of a permutation flow shop problem with sequence‐
independent setup time. The objective is to minimize the maximum of job completion time …
independent setup time. The objective is to minimize the maximum of job completion time …