The proportionate flow shop total tardiness problem (Q2178064): Difference between revisions

@@ 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 @@
+On             <i>J</i>             -maximal and             <i>J</i>             -minimal Flow-Shop Schedules
+Normal rank
@@ Property / cites work @@
+One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
+Normal rank
@@ Property / cites work @@
+A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
+Normal rank
@@ Property / cites work @@
+New Precedence Theorems for One-Machine Weighted Tardiness
+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 note: minimizing maximum earliness on a proportionate flowshop
+Normal rank
@@ Property / cites work @@
+On equivalence between the proportionate flow shop and single‐machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank
@@ Property / cites work @@
+The just-in-time scheduling problem in a flow-shop scheduling system
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted completion time in a proportionate flow shop
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank