Two-machine flowshop minimum-length scheduling problem with random and bounded processing times (Q4806914): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/1475-3995.00393
+Normal rank
@@ Property / OpenAlex ID @@
+W2008958187
@@ Property / OpenAlex ID: W2008958187 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
+Normal rank
@@ Property / cites work @@
+Scheduling in stochastic flowshops with independent setup, processing and removal times
+Normal rank
@@ Property / cites work @@
+Two-machine ordered flowshop scheduling under random breakdowns
+Normal rank
@@ Property / cites work @@
+Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
+Normal rank
@@ Property / cites work @@
+Two machine mixed shop scheduling problem with controllable machine speeds
+Normal rank
@@ Property / cites work @@
+Stochastically minimizing the makespan in two-machine flow shops without blocking
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
+Normal rank