Search
Now showing items 1-8 of 8
A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)
In this paper, a memetic algorithm with a variable block insertion heuristic is presented to solve the single machine total weighted tardiness problem with sequence dependent setup times. Together with the traditional ...
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 discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(Information Sciences, 2011)
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ...
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion
(2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)
Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ...
A Memetic Algorithm With A Variable Block Insertion Heuristic for Single Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times
(IEEE, 2016)
In this paper, a memetic algorithm with a variable block insertion heuristic is presented to solve the single machine total weighted tardiness problem with sequence dependent setup times. Together with the traditional ...
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 discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(ELSEVIER SCIENCE INC, 2011)
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ...
A Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop Scheduling Problem with Total Flowtime Criterion
(IEEE, 2010)
Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
