An adaptive branching rule for the permutation flow-shop problem (Q1141078): Difference between revisions

@@ Property / cites work @@
+A Comparative Study of Flow-Shop Algorithms
@@ Property / cites work: A Comparative Study of Flow-Shop Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+Job-Shop Scheduling by Implicit Enumeration
@@ Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling two job classes on a single machine
@@ Property / cites work: Scheduling two job classes on a single machine / rank @@
+Normal rank
@@ Property / cites work @@
+On general routing problems
@@ Property / cites work: On general routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Elimination methods in them ×n sequencing problem
+Normal rank