Fast approximation algorithms for job scheduling with processing set restrictions (Q410716): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.08.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2113497279
@@ Property / OpenAlex ID: W2113497279 / rank @@
+Normal rank
@@ Property / cites work @@
+On-Line Load Balancing in a Hierarchical Server Topology
+Normal rank
@@ Property / cites work @@
+Q4247460
@@ Property / cites work: Q4247460 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with job assignment restrictions
+Normal rank
@@ Property / cites work @@
+Scheduling unit length jobs with parallel nested machine processing set restrictions
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with nested processing set restrictions
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling under a grade of service provision
+Normal rank
@@ Property / cites work @@
+Task Scheduling on a Multiprocessor System with Independent Memories
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Scheduling parallel machines with inclusive processing set restrictions and job release times
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with nested job assignment restrictions
+Normal rank
@@ Property / cites work @@
+Scheduling parallel machines with inclusive processing set restrictions
+Normal rank
@@ Property / cites work @@
+An optimal rounding gives a better approximation for scheduling unrelated machines
+Normal rank