A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724): Difference between revisions

@@ Property / cites work @@
+Fast heuristics for minimizing the makespan in non-permutation flow shops
+Normal rank
@@ Property / cites work @@
+An improved NEH-based heuristic for the permutation flowshop problem
+Normal rank
@@ Property / cites work @@
+An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
+Normal rank
@@ Property / cites work @@
+On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
+Normal rank
@@ Property / cites work @@
+A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
+Normal rank
@@ Property / cites work @@
+An improved NEH heuristic to minimize makespan in permutation flow shops
+Normal rank
@@ Property / cites work @@
+A fast tabu search algorithm for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
+Normal rank
@@ Property / cites work @@
+Some efficient heuristic methods for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+New hard benchmark for flowshop scheduling problems minimising makespan
+Normal rank