Q6065401 (Q6065401): Difference between revisions

@@ Property / cites work @@
+Scheduling time-constrained communication in linear networks
+Normal rank
@@ Property / cites work @@
+On minimizing the weighted number of late jobs in unit execution time open-shops.
+Normal rank
@@ Property / cites work @@
+Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+Approximating the Throughput of Multiple Machines in Real-Time Scheduling
+Normal rank
@@ Property / cites work @@
+On the competitiveness of on-line real-time task scheduling
+Normal rank
@@ Property / cites work @@
+Improvements in throughout maximization for real-time scheduling
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+New hardness results for congestion minimization and machine scheduling
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
+Normal rank
@@ Property / cites work @@
+Note on scheduling intervals on-line
@@ Property / cites work: Note on scheduling intervals on-line / rank @@
+Normal rank
@@ Property / cites work @@
+The Fixed Job Schedule Problem with Working-Time Constraints
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking \(1-1/e\) barrier for non-preemptive throughput maximization
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
+Normal rank
@@ Property / cites work @@
+A Fast Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Q6065401
@@ Property / cites work: Q6065401 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128889
@@ Property / cites work: Q3128889 / rank @@
+Normal rank
@@ Property / cites work @@
+Fifty years of scheduling: a survey of milestones
@@ Property / cites work: Fifty years of scheduling: a survey of milestones / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / cites work @@
+Open Problems in Throughput Scheduling
@@ Property / cites work: Open Problems in Throughput Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4400854
@@ Property / cites work: Q4400854 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6065401