Minimizing total completion time for re-entrant flow shop scheduling problems (Q650903): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.08.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2005705791
@@ Property / OpenAlex ID: W2005705791 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a two-machine re-entrant flowshop
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on an \(m\)-machine re-entrant flowshop
+Normal rank
@@ Property / cites work @@
+Minimizing total tardiness on a two-machine re-entrant flowshop
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for two-machine re-entrant shop scheduling
+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 @@
+Heuristic algorithms for two machine re-entrant flow shop
+Normal rank
@@ Property / cites work @@
+Mean Flow Time Minimization in Reentrant Job Shops with a Hub
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in re-entrant permutation flow-shops
+Normal rank
@@ Property / cites work @@
+Minimizing Makespan in a Class of Reentrant Shops
@@ Property / cites work: Minimizing Makespan in a Class of Reentrant Shops / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-family scheduling in a two-machine reentrant flow shop with setups
+Normal rank