Heuristic algorithms for two machine re-entrant flow shop (Q930923): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2008.02.046
+Normal rank
@@ Property / OpenAlex ID @@
+W1977288447
@@ Property / OpenAlex ID: W1977288447 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a two-machine re-entrant flowshop
+Normal rank
@@ Property / cites work @@
+Decomposition methods for reentrant flow shops with sequence-dependent setup times
+Normal rank
@@ Property / cites work @@
+A heuristic algorithm for two-machine re-entrant shop scheduling
+Normal rank
@@ Property / cites work @@
+Batching and Scheduling in FMS Hubs: Flow Time Considerations
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in re-entrant permutation flow-shops
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+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