Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan (Q724743): Difference between revisions

@@ Property / cites work @@
+Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
+Normal rank
@@ Property / cites work @@
+From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
+Normal rank
@@ Property / cites work @@
+From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
+Normal rank
@@ Property / cites work @@
+Scheduling jobshops with some identical or similar jobs
+Normal rank
@@ Property / cites work @@
+Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
+Normal rank
@@ Property / cites work @@
+A Fluid Heuristic for Minimizing Makespan in Job Shops
+Normal rank
@@ Property / cites work @@
+The expected asymptotical ratio for preemptive stochastic online problem
+Normal rank
@@ Property / cites work @@
+Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
+Normal rank
@@ Property / cites work @@
+A fluid approach to large volume job shop scheduling
+Normal rank
@@ Property / cites work @@
+An algorithm for the maximum revenue jobshop problem
+Normal rank