Two-machine flowshop scheduling to minimize total tardiness (Q4352599): Difference between revisions

@@ 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 @@
+Optimal two- and three-stage production schedules with setup times included
+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 @@
+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 @@
+The two-machine flowshop scheduling problem with total tardiness
+Normal rank
@@ Property / cites work @@
+Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
+Normal rank