Minimizing total completion time in two-stage hybrid flow shop with dedicated machines (Q622160): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2010.10.009
@@ Property / DOI: 10.1016/j.cor.2010.10.009 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2010.10.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2089830689
@@ Property / OpenAlex ID: W2089830689 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and bound algorithm for the flow shop with multiple processors
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
+Normal rank
@@ Property / cites work @@
+Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in hybrid flowshops
@@ Property / cites work: Minimizing makespan in hybrid flowshops / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing a hybrid two-stage flowshop with dedicated machines
+Normal rank
@@ Property / cites work @@
+A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2010.10.009
@@ Property / DOI: 10.1016/J.COR.2010.10.009 / rank @@
+Normal rank