A decomposition algorithm for the single machine total tardiness problem (Q1838424): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(82)90035-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2036912539
@@ Property / OpenAlex ID: W2036912539 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
+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 @@
+The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
+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 @@
+On the <i>N</i>-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
+Normal rank
@@ Property / cites work @@
+A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
+Normal rank