A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2004.00461.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2008570019
@@ Property / OpenAlex ID: W2008570019 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
+Normal rank
@@ Property / cites work @@
+The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
+Normal rank
@@ Property / cites work @@
+No-wait flowshops with bicriteria of makespan and total completion time
+Normal rank
@@ Property / cites work @@
+The two-machine total completion time flow shop problem
+Normal rank
@@ Property / cites work @@
+Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem             <i>n / 2 / F / F¯</i>
+Normal rank
@@ Property / cites work @@
+Heuristics for scheduling in flowshop with multiple objectives
+Normal rank
@@ Property / cites work @@
+A bicriteria two-machine permutation flowshop problem
+Normal rank
@@ Property / cites work @@
+A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem
+Normal rank