Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling jobs to minimize total cost
@@ Property / cites work: Scheduling jobs to minimize total cost / rank @@
+Normal rank
@@ Property / cites work @@
+A parametric maximum flow algorithm for bipartite graphs with applications
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
+Normal rank
@@ Property / cites work @@
+Q3940839
@@ Property / cites work: Q3940839 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
+Normal rank
@@ Property / cites work @@
+Q3525911
@@ Property / cites work: Q3525911 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Jobs on Several Machines with the Job Splitting Property
+Normal rank