On the complexity of constructing multiprocessor little-preemptive schedules (Q902062): Difference between revisions

@@ Property / author @@
-Evgeny V. Shchepin
@@ Property / author: Evgeny V. Shchepin / rank @@
-Normal rank
@@ Property / author @@
+Evgeny V. Shchepin
@@ Property / author: Evgeny V. Shchepin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
+Normal rank
@@ Property / cites work @@
+On the geometry, preemptions and complexity of multiprocessor and shop scheduling
+Normal rank
@@ Property / cites work @@
+A note on the proof of the complexity of the little-preemptive open-shop problem
+Normal rank
@@ Property / cites work @@
+Q3075100
@@ Property / cites work: Q3075100 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536419
@@ Property / cites work: Q4536419 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4681923
@@ Property / cites work: Q4681923 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal rounding gives a better approximation for scheduling unrelated machines
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s0081543815060152
+Normal rank
@@ Property / OpenAlex ID @@
+W2265199291
@@ Property / OpenAlex ID: W2265199291 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:902062