A multi-level optimization approach for energy-efficient flexible flow shop scheduling

2016 ◽  
Vol 137 ◽  
pp. 1543-1552 ◽  
Author(s):  
Jihong Yan ◽  
Lin Li ◽  
Fu Zhao ◽  
Fenyang Zhang ◽  
Qingliang Zhao
2017 ◽  
Vol 10 (12) ◽  
pp. 197
Author(s):  
Mohammad Rahmanidoust

The paper suggests a new rule; called no-wait process. The rule has two stages, and is a flexible flow shop scheduling. The process is the subject to maximize tardiness while minimizing the makespan. This hybrid flow shop problem is known to be NP-hard. Therefore, we come to first, Non-dominated Sorting Genetic Algorithm (NSGA-II), then, Multi-Objective Imperialist Competitive Algorithm (MOICA) and finally, Pareto Archive Evolutionary Strategy (PAES) as three multi-objective Pareto based metaheuristic optimization methods. They are developed to solve the problem to approximately figure out optimal Pareto front. The method is investigated in several problems that differed in size and terms of relative percentage deviation of performance metrics. The conclusion, developed by this method is the most efficient and practicable algorithm at the end.


2020 ◽  
Vol 141 ◽  
pp. 112902 ◽  
Author(s):  
Guiliang Gong ◽  
Raymond Chiong ◽  
Qianwang Deng ◽  
Wenwu Han ◽  
Like Zhang ◽  
...  

2020 ◽  
pp. 1-14
Author(s):  
Waraporn Fangrit ◽  
Hwa Jen Yap ◽  
Mukhtar Fatihu Hamza ◽  
Siow-Wee Chang ◽  
Keem Siah Yap ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document