APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931): Difference between revisions

@@ Property / cites work @@
+Complexity of scheduling problems with multi-purpose machines
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation Guarantees for Job-Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Coordination Complexity of Parallel Price-Directive Decomposition
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
+Normal rank
@@ Property / cites work @@
+Effective neighbourhood functions for the flexible job shop problem
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Bounding algorithm for the routing problem with arbitrary paths and alternative servers
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Shop Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Short Shop Schedules
@@ Property / cites work: Short Shop Schedules / rank @@
+Normal rank