Publisher
Now showing items 1-3 of 3
-
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 ... -
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(Computers and Operations Research, 2017)Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ... -
Metaheuristic algorithms for the hybrid flowshop scheduling problem
(Computers and Operations Research, 2019)The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan ...