Review of sequencing research (Q5599453): Difference between revisions

@@ Property / DOI @@
-.1002/nav.3800170103
@@ Property / DOI: 10.1002/nav.3800170103 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.3800170103
+Normal rank
@@ Property / OpenAlex ID @@
+W2162149932
@@ Property / OpenAlex ID: W2162149932 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Treatment of the Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3244470
@@ Property / cites work: Q3244470 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5602518
@@ Property / cites work: Q5602518 / rank @@
+Normal rank
@@ Property / cites work @@
+The sequencing of “related” jobs
@@ Property / cites work: The sequencing of “related” jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Some problems in queueing with dynamic priorities
@@ Property / cites work: Some problems in queueing with dynamic priorities / rank @@
+Normal rank
@@ Property / cites work @@
+On two queues in parallel
@@ Property / cites work: On two queues in parallel / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/NAV.3800170103
@@ Property / DOI: 10.1002/NAV.3800170103 / rank @@
+Normal rank