Journal
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING
Volume 38, Issue 8, Pages 2233-2244Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s13369-013-0611-4
Keywords
Multi-objective optimization; Hybrid flow shop; Multi-objective evolutionary algorithms; Sequence-dependent family setup times; Group scheduling; Makespan; Total tardiness
Categories
Ask authors/readers for more resources
This paper deals with the problem of hybrid flow shop scheduling. In this investigation, we considered group scheduling within the area of sequence-dependent family setup times and two objectives of minimizing makespan and total tardiness are taken into consideration simultaneously. Due to the computational complexity in solving these set of problems with multiple objectives, metaheuristics has a high priority, because these algorithms are capable of solving combinatorial problems in a reasonable time. This study focuses on three multi-objective algorithms, multi-objective genetic algorithm, sub-population genetic algorithm-II and non-dominated sorting genetic algorithm-II, to solve the mentioned problem. In order to investigate the effectiveness and efficiency of applying the noted metaheuristics for such an NP-hard problem, we evaluate non-dominated solution sets obtained via each algorithm through some evaluation metrics.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available