A special case of the single-machine total tardiness problem is NP-hard (Q1946412): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Algorithmic paradoxes of the single-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+On decomposition of the total tardiness problem
@@ Property / cites work: On decomposition of the total tardiness problem / rank @@
+Normal rank