A New Hybrid Heuristic for Minimizing Total Flow Time in Permutation Flow Shop

2017 ◽  
Author(s):  
Wikanda Phaphan
Keyword(s):  
Flow Shop ◽  
Flow Time ◽  
Total Flow ◽  
Hybrid Heuristic ◽  
Total Flow Time ◽  
Permutation Flow Shop

Scheduling to Minimize the Sum of Weighted Total Flow Time and Makespan in a Permutation Flow Shop with Setup Time

2015 ◽  
Vol 766-767 ◽  
pp. 989-994 ◽  
Author(s):  
M. Saravanan ◽  
S. Joseph Dominic Vijayakumar ◽  
R. Srinivasan ◽  
S. Paul Singarayar
Keyword(s):  
Simulated Annealing Algorithm ◽  
Flow Shop ◽  
Optimal Schedule ◽  
Setup Time ◽  
Flow Time ◽  
Flow Shop Scheduling ◽  
Benchmark Problems ◽  
Total Flow ◽  
Total Flow Time ◽  
Permutation Flow Shop

The Permutation Flow shop Scheduling Problem is a typical combinational optimization problem and has been proved to be strongly NP-hard. This paper deals with B-GRASP algorithm meta-heuristic in finding the solution and in analyzing the best the optimal schedule, thus minimizing the bi-objectives such as weighted makespan and total flow time. The proposed approach is evaluated using benchmark problems taken from Taillard and compared with simulated annealing algorithm. Computational experiments indicate that the proposed B-GRASP algorithm is a feasible and effective approach for the multiobjective problem.

An effective heuristic for flow shop problems with total flow time as criterion

1993 ◽  
Vol 25 (1-4) ◽  
pp. 219-222 ◽  
Author(s):  
Venkateswara S. Vempati ◽  
Chuen-Lung Chen ◽  
Stanley F. Bullington
Keyword(s):  
Flow Shop ◽  
Flow Time ◽  
Total Flow ◽  
Total Flow Time
Sign in / Sign up

Export Citation Format

Share Document