A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741): Difference between revisions

@@ Property / cites work @@
+The two-machine flowshop scheduling problem with total tardiness
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem
+Normal rank
@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+A new integer programming formulation for the permutation flowshop problem
+Normal rank
@@ Property / cites work @@
+Generating improved dominance conditions for the flowshop problem
+Normal rank
@@ Property / cites work @@
+Focused Scheduling in Proportionate Flowshops
@@ Property / cites work: Focused Scheduling in Proportionate Flowshops / rank @@
+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
@@ Property / cites work @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+On general routing problems
@@ Property / cites work: On general routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
+Normal rank
@@ Property / cites work @@
+A decomposition algorithm for the single machine total tardiness problem
+Normal rank