On single-walk parallelization of the job shop problem solving algorithms (Q1761161): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2011.11.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2156476100
@@ Property / OpenAlex ID: W2156476100 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of metaheuristics
@@ Property / cites work: Handbook of metaheuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692627
@@ Property / cites work: Q5692627 / rank @@
+Normal rank
@@ Property / cites work @@
+New and ``stronger'' job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
+Normal rank
@@ Property / cites work @@
+A fast tabu search algorithm for the permutation flow-shop problem
+Normal rank
@@ Property / cites work @@
+An advanced tabu search algorithm for the job shop problem
+Normal rank
@@ Property / cites work @@
+A tabu search method guided by shifting bottleneck for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Fast parallel heuristics for the job shop scheduling problem
+Normal rank
@@ Property / cites work @@
+New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank