A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599): 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.disc.2008.10.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2103040812
@@ Property / OpenAlex ID: W2103040812 / rank @@
+Normal rank
@@ Property / cites work @@
+The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
+Normal rank
@@ Property / cites work @@
+Scheduling preemptive jobs with precedence constraints on parallel machines
+Normal rank
@@ Property / cites work @@
+Q3686754
@@ Property / cites work: Q3686754 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
+Normal rank
@@ Property / cites work @@
+Optimal preemptive scheduling on a fixed number of identical parallel machines
+Normal rank
@@ Property / cites work @@
+A relation between multiprocessor scheduling and linear programming
+Normal rank
@@ Property / cites work @@
+Scheduling Interval-Ordered Tasks
@@ Property / cites work: Scheduling Interval-Ordered Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling of interval orders is polynomial
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1043599