An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072): Difference between revisions

@@ Property / cites work @@
+Two-machine flowshop scheduling to minimize mean flow time
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized pairwise interchanges and machine scheduling
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+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 @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
+Normal rank