Decomposition of the single machine total tardiness problem (Q1362989): Difference between revisions

@@ Property / cites work @@
+Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
+Normal rank
@@ Property / cites work @@
+Q3993992
@@ Property / cites work: Q3993992 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
+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 @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+Dynamic programming and decomposition approaches 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