Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-77903-2_3
+Normal rank
@@ Property / OpenAlex ID @@
+W1594394581
@@ Property / OpenAlex ID: W1594394581 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Techniques for Average Completion Time Scheduling
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4197923
@@ Property / cites work: Q4197923 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Competitive Analysis
@@ Property / cites work: Beyond Competitive Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling to minimize average completion time revisited.
+Normal rank
@@ Property / cites work @@
+Models and Algorithms for Stochastic Online Scheduling
+Normal rank
@@ Property / cites work @@
+Approximation in Preemptive Stochastic Online Scheduling
+Normal rank
@@ Property / cites work @@
+Stochastic scheduling problems I — General strategies
+Normal rank
@@ Property / cites work @@
+Approximation in stochastic scheduling
@@ Property / cites work: Approximation in stochastic scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling for Minimum Total Loss Using Service Time Distributions
+Normal rank
@@ Property / cites work @@
+Stochastic Machine Scheduling with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines
+Normal rank