A note on the optimality of index priority rules for search and sequencing problems (Q5392799): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/nav.20442
@@ Property / full work available at URL: https://doi.org/10.1002/nav.20442 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2169371815
@@ Property / OpenAlex ID: W2169371815 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the total weighted completion time of deteriorating jobs
+Normal rank
@@ Property / cites work @@
+Scheduling Deteriorating Jobs on a Single Processor
+Normal rank
@@ Property / cites work @@
+A Characterization of the Rau Class of Sequential Problems
+Normal rank
@@ Property / cites work @@
+Optimal strategies for a class of constrained sequential problems
+Normal rank
@@ Property / cites work @@
+A Remark on Search and Sequencing Problems
@@ Property / cites work: A Remark on Search and Sequencing Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing with Series-Parallel Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Technical Note—Minimizing a Function of Permutations of <i>n</i> Integers
+Normal rank
@@ Property / cites work @@
+Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices
+Normal rank
@@ Property / cites work @@
+Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
+Normal rank