A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2007.12.031
@@ Property / DOI: 10.1016/j.ejor.2007.12.031 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2007.12.031
+Normal rank
@@ Property / OpenAlex ID @@
+W1976596296
@@ Property / OpenAlex ID: W1976596296 / rank @@
+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
@@ Property / cites work @@
+Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Improving the complexities of approximation algorithms for optimization problems
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation scheme for the total tardiness problem
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Some remarks on the decomposition properties of the single machine total tardiness problem
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2007.12.031
@@ Property / DOI: 10.1016/J.EJOR.2007.12.031 / rank @@
+Normal rank