Minimizing flow time on a constant number of machines with preemption (Q1779706): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2004.07.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2147877827
@@ Property / OpenAlex ID: W2147877827 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the flow time without migration
@@ Property / cites work: Minimizing the flow time without migration / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250192
@@ Property / cites work: Q4250192 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for preemptive weighted flow time
+Normal rank
@@ Property / cites work @@
+Minimizing mean flow time with release time constraint
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3840371
@@ Property / cites work: Q3840371 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation schemes for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q4228496
@@ Property / cites work: Q4228496 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q4526975
@@ Property / cites work: Q4526975 / rank @@
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1779706