Search
Now showing items 1-4 of 4
A variable block insertion heuristic for permutation flowshops with makespan criterion
(2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
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 ...
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
(PERGAMON-ELSEVIER SCIENCE LTD, 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 ...
A variable block insertion heuristic for permutation flowshops with makespan criterion
(IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...