A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+New block properties for the permutation flow shop problem with application in tabu search
+Normal rank
@@ Property / cites work @@
+Modified simulated annealing algorithms for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+A fast tabu search algorithm for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop 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 @@
+On the heuristic solution of the permutation flow shop problem by path algorithms
+Normal rank
@@ Property / cites work @@
+A new heuristic method for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+Q5692627
@@ Property / cites work: Q5692627 / rank @@
+Normal rank
@@ Property / cites work @@
+On two-machine scheduling with release and due dates to minimize maximum lateness
+Normal rank
@@ Property / cites work @@
+Q3309440
@@ Property / cites work: Q3309440 / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part I
@@ Property / cites work: Tabu Search—Part I / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu Search—Part II
@@ Property / cites work: Tabu Search—Part II / rank @@
+Normal rank
@@ Property / cites work @@
+A block approach for single-machine scheduling with release dates and due dates
+Normal rank
@@ Property / cites work @@
+On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
+Normal rank