A greedy heuristic for the mean tardiness sequencing problem (Q1317079): Difference between revisions

@@ 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/0305-0548(94)90094-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2093215438
@@ Property / OpenAlex ID: W2093215438 / rank @@
+Normal rank
@@ Property / cites work @@
+An experimental comparison of solution algorithms for the single-machine tardiness problem
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+A dual algorithm for the one-machine scheduling problem
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000368
@@ Property / cites work: Q4000368 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Minimizing Total Costs in One-Machine Scheduling
@@ Property / cites work: Minimizing Total Costs in One-Machine Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
+Normal rank