Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling (Q1869668): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and bound algorithm for the flow shop with multiple processors
+Normal rank
@@ Property / cites work @@
+Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Stage, Hybrid Flowshop Scheduling Problem
@@ Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the two-stage assembly scheduling problem
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
+Normal rank
@@ Property / cites work @@
+The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
+Normal rank
@@ Property / cites work @@
+Global lower bounds for flow shops with multiple processors
+Normal rank
@@ Property / cites work @@
+Scheduling algorithms for flexible flowshops: Worst and average case performance
+Normal rank