An approximate solution of the flow-shop problem with sequence dependent setup times

1989 ◽  
Vol 33 (6) ◽  
pp. 439-451
Author(s):  
W. Szwarc ◽  
J. J. Liu
Keyword(s):  
Approximate Solution ◽  
Flow Shop ◽  
Setup Times ◽  
Sequence Dependent ◽  
Flow Shop Problem ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

scholarly journals Grid-Based Hybrid Genetic Approach to Relaxed Flexible Flow Shop with Sequence-Dependent Setup Times

2022 ◽  
Vol 12 (2) ◽  
pp. 607
Author(s):  
Fredy Juárez-Pérez ◽  
Marco Antonio Cruz-Chávez ◽  
Rafael Rivera-López ◽  
Erika Yesenia Ávila-Melgar ◽  
Marta Lilia Eraña-Díaz ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Flow Shop ◽  
Setup Times ◽  
Flexible Flow Shop ◽  
Local Searches ◽  
Sequence Dependent ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Flexible Flow Shop Scheduling ◽  
Sequence Dependent Setup Times

In this paper, a hybrid genetic algorithm implemented in a grid environment to solve hard instances of the flexible flow shop scheduling problem with sequence-dependent setup times is introduced. The genetic algorithm takes advantage of the distributed computing power on the grid to apply a hybrid local search to each individual in the population and reach a near optimal solution in a reduced number of generations. Ant colony systems and simulated annealing are used to apply a combination of iterative and cooperative local searches, respectively. This algorithm is implemented using a master–slave scheme, where the master process distributes the population on the slave process and coordinates the communication on the computational grid elements. The experimental results point out that the proposed scheme obtains the upper bound in a broad set of test instances. Also, an efficiency analysis of the proposed algorithm indicates its competitive use of the computational resources of the grid.

Sign in / Sign up

Export Citation Format

Share Document