Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns

2008 ◽  
Vol 42 (1-2) ◽  
pp. 189-201 ◽  
Author(s):  
M. Gholami ◽  
M. Zandieh ◽  
A. Alem-Tabriz
Keyword(s):  
Flow Shop ◽  
Setup Times ◽  
Hybrid Flow Shop ◽  
Sequence Dependent ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times ◽  
Random Breakdowns

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.

Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem

2011 ◽  
Vol 110-116 ◽  
pp. 4063-4069 ◽  
Author(s):  
Mohsen Varmazyar ◽  
Nasser Salmasi
Keyword(s):  
Heuristic Algorithms ◽  
Flow Shop ◽  
Setup Times ◽  
Tabu List ◽  
Sequence Dependent ◽  
Number Of Tardy Jobs ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Tardy Jobs ◽  
Sequence Dependent Setup Times

This paper investigates permutation flow shop scheduling problems with sequence-dependent setup times with minimizing the number of tardy jobs as criterion (Fm|prmu,Sijk|∑Uj). Since the proposed research problem has been proven to be NP-hard, three different meta heuristic algorithms based on tabu search (TS) has been proposed to solve the problem. These three algorithms are different based on their tabu list characteristics. In order to evaluate the performance of the proposed TS algorithms, test problems in different ranges are generated to find the best algorithm. The comparison shows that the TS algorithm which its tabu list keeps track of the slots that the jobs are assigned has a better performance than the other algorithms

Sign in / Sign up

Export Citation Format

Share Document