Search
Now showing items 1-3 of 3
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
(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 ...
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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
