Author
Now showing items 1-8 of 8
-
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
(SPRINGER-VERLAG BERLIN, 2012)In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ... -
A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ... -
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2011)This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ... -
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
(Computers and Industrial Engineering, 2011)This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ... -
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion
(IEEE SSCI 2014 - 2014 IEEE Symposium Series on Computational Intelligence - CIPLS 2014: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, Proceedings, 2014)The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ... -
An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion
(IEEE, 2014)The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. ... -
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms
(PERGAMON-ELSEVIER SCIENCE LTD, 2010)In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, ... -
Minimizing the total flow time in a flow shop with blocking by using hybridm harmony search algorithms
(Expert Systems with Applications, 2010)In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
