Author
Now showing items 1-20 of 103
-
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 differential evolution algorithm for the median cycle problem
(IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution, 2011)This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ... -
A Differential Evolution Algorithm for the Median Cycle Problem
(IEEE, 2011)This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ... -
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
(International Journal of Production Research, 2011)In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable ... -
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
(TAYLOR & FRANCIS LTD, 2011)In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable ... -
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem
(2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings, 2015)This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ... -
A Differential Evolution Algorithm with Variable Neighborhood Search for Multidimensional Knapsack Problem
(IEEE, 2015)This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ... -
A discrete artificial bee colony algorithm for the energy-efficient no-wait flowshop scheduling problem
(Procedia Manufacturing, 2019)No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP), where the processing of each job must be continuous from start to end without any interruption. ... -
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(Information Sciences, 2011)In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the ... -
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(ELSEVIER SCIENCE INC, 2011)In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the ... -
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
(ELSEVIER SCIENCE INC, 2014)This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ... -
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
(Applied Mathematical Modelling, 2014)This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ... -
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(Applied Mathematical Modelling, 2013)In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ... -
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(ELSEVIER SCIENCE INC, 2013)In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ... -
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 ... -
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 discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times
(2016 IEEE Congress on Evolutionary Computation, CEC 2016, 2016)A discrete artificial bee colony (DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ... -
A Discrete Artificial Bee Colony Algorithm for the Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times
(IEEE, 2016)A discrete artificial bee colony ( DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ... -
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. ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
