Search
Now showing items 1-6 of 6
A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
(Computers and Operations Research, 2013)
This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG-DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ...
A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops
(Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2013)
This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ...
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
(SPRINGER-VERLAG BERLIN, 2013)
In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...
A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops
(SPRINGER-VERLAG BERLIN, 2012)
In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
