A new sufficient condition of optimality for the two-machine flowshop problem (Q2572845): Difference between revisions

@@ Property / cites work @@
+Q3964287
@@ Property / cites work: Q3964287 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Dominance Concept in Scheduling <i>n</i> Jobs on a Single Machine with Ready Times and Due Dates
+Normal rank
@@ Property / cites work @@
+Project scheduling under uncertainty: survey and research potentials
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
+Normal rank