A linear time algorithm for restricted bin packing and scheduling problems (Q1837623): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(83)90042-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2065394292
@@ Property / OpenAlex ID: W2065394292 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3940840
@@ Property / cites work: Q3940840 / rank @@
+Normal rank
@@ Property / cites work @@
+Deadline scheduling of tasks with ready times and resource constraints
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Complexity Results for Multiprocessor Scheduling under Resource Constraints
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4170510
@@ Property / cites work: Q4170510 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
+Normal rank
@@ Property / cites work @@
+Q4113925
@@ Property / cites work: Q4113925 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank