Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+4130183
@@ Property / zbMATH DE Number: 4130183 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+flow shop
@@ Property / zbMATH Keywords: flow shop / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+machine scheduling
@@ Property / zbMATH Keywords: machine scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sum of completion times
@@ Property / zbMATH Keywords: sum of completion times / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bounds
@@ Property / zbMATH Keywords: lower bounds / rank @@
+Normal rank
@@ 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.1016/0377-2217(90)90244-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2060829858
@@ Property / OpenAlex ID: W2060829858 / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+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 @@
+Heuristic-Programming Solution of a Flowshop-Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:582206