| dc.contributor.author | keskintürk, timur | |
| dc.contributor.author | DAĞ, Sündüz | |
| dc.date.accessioned | 2021-03-06T21:10:18Z | |
| dc.date.available | 2021-03-06T21:10:18Z | |
| dc.date.issued | 2015 | |
| dc.identifier.citation | DAĞ S., keskintürk t., "Hybrid Metaheuristic for the Permutation Flowshop Scheduling Problems", journal of multidisiplanary engineering, cilt.2, no.2, ss.148-152, 2015 | |
| dc.identifier.other | vv_1032021 | |
| dc.identifier.other | av_fd86b862-4078-400d-9983-2abc2b308465 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12627/165848 | |
| dc.description.abstract | Abstract — This paper considers a hybrid metaheuristic for the Permutation flow shop Scheduling Problems with the objective of minimizing makespan. Genetic algorithm and kangaroo algorithm are proposed to solve the problem. A genetic algorithm fulfills the diversification phase ofthe optimization. By means of this phase, the population contains Fgood solutions placed in different points of the solution space. Kangaroo algorithm fulfils the intensification phase. Every individual solution from the first phase is considered as an initial solution for the Kangaroo algorithm. The proposed hybrid algorithm is tested with benchmark problems and solution results performance was compared with the existing heuristics. | |
| dc.language.iso | eng | |
| dc.title | Hybrid Metaheuristic for the Permutation Flowshop Scheduling Problems | |
| dc.type | Makale | |
| dc.relation.journal | journal of multidisiplanary engineering | |
| dc.contributor.department | İstanbul Üniversitesi , , | |
| dc.identifier.volume | 2 | |
| dc.identifier.issue | 2 | |
| dc.identifier.startpage | 148 | |
| dc.identifier.endpage | 152 | |
| dc.contributor.firstauthorID | 595126 | |
