Using Constructive and Tabu Search algorithms for solving the flexible flow shop problem to optimality

2015 ◽  
Author(s):  
R. Alkhatrshi
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Search Algorithms ◽  
Flexible Flow Shop ◽  
Flow Shop Problem

An efficiency improvement of flexible flow shop scheduling in automotive part company

2020 ◽  
pp. 1-14
Author(s):  
Waraporn Fangrit ◽  
Hwa Jen Yap ◽  
Mukhtar Fatihu Hamza ◽  
Siow-Wee Chang ◽  
Keem Siah Yap ◽  
...  
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Simulation Software ◽  
Flow Shop Scheduling ◽  
Current Status ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Scheduling Method ◽  
Automotive Part ◽  
Flexible Flow Shop Scheduling

Flexible flow shop is becoming more interested and applied in industries due to its impact from higher workloads. Flexible flow shop scheduling problem is focused to minimize the makespan. A metaheuristic model based on Hybrid Tabu Search is developed to overcome this problem. Firstly, Hybrid Tabu Search is modelled based on the factory data. The Earliest Due Date rule is used as the scheduling method for the current status. FlexSim simulation software is used to evaluate the Hybrid Tabu Search model. The outcome is validated with two different basic heuristic solutions; Campbell, Dudek and Smith’s and Gupta’s heuristics. It is found that the proposed model can improve the job sequence based on makespan criteria.

Parallel tabu search algorithm for the hybrid flow shop problem

2013 ◽  
Vol 65 (3) ◽  
pp. 466-474 ◽  
Author(s):  
Wojciech Bożejko ◽  
Jarosław Pempera ◽  
Czesław Smutnicki
Keyword(s):  
Tabu Search ◽  
Flow Shop ◽  
Search Algorithm ◽  
Hybrid Flow Shop ◽  
Tabu Search Algorithm ◽  
Flow Shop Problem ◽  
Parallel Tabu Search

A Heuristics Based on RA for Two-Stage Flexible Flow Shop Scheduling with Head Group Constraint

2011 ◽  
Vol 101-102 ◽  
pp. 783-789
Author(s):  
Zhan Tao Li ◽  
Qing Xin Chen ◽  
Ning Mao
Keyword(s):  
Flow Shop ◽  
Heuristic Method ◽  
Flow Shop Scheduling ◽  
Head Group ◽  
Start Time ◽  
Two Stage ◽  
Flexible Flow Shop ◽  
Shop Scheduling ◽  
Flow Shop Problem ◽  
Flexible Flow Shop Scheduling

Rapid access (RA) is an effective heuristic method for solving the permutation flow shop problem with the objective of makespan. This paper proposes a heuristic IRA (i.e., improved RA) for the two-stage flexible flow shop scheduling problem with head group constraint. In the heuristic IRA, two dispatch rules, i.e., earliest completion time first (ECT)) and earliest start time first (EST), are proposed for allocating devices for tasks. Benchmark testing results show that using ECT dispatch rule can significantly improve the performance of heuristic IRA. As comparison, the heuristic CDS and heuristic Palmer have also simulated under the same conditions, and the results show that the IRA is able to provide much better performance.

Sign in / Sign up

Export Citation Format

Share Document