Stochastically Minimizing Total Penalty Costs in the Two-Machine Flow Shop with Random Processing Times (Q3200873): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/01966324.1988.10737234
+Normal rank
@@ Property / OpenAlex ID @@
+W1972359790
@@ Property / OpenAlex ID: W1972359790 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
+Normal rank
@@ Property / cites work @@
+Minimizing total expected costs in the two-machine, stochastic flow shop
+Normal rank
@@ Property / cites work @@
+On Johnson's Two-Machine Flow Shop with Random Processing Times
+Normal rank
@@ Property / cites work @@
+Minimizing the Expected Makespan in Stochastic Flow Shops
+Normal rank
@@ Property / cites work @@
+Inequalities for stochastic flow shops and job shops
+Normal rank
@@ Property / cites work @@
+Scheduling with Random Service Times
@@ Property / cites work: Scheduling with Random Service Times / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimum Spanning Tree Problem with Time Window Constraints
+Normal rank