A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-006-9001-0
@@ Property / DOI: 10.1007/s10878-006-9001-0 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-9001-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2049449905
@@ Property / OpenAlex ID: W2049449905 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Problems with Two Competing Agents
@@ Property / cites work: Scheduling Problems with Two Competing Agents / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with high multiplicity
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
+Normal rank
@@ Property / DOI @@
+.1007/S10878-006-9001-0
@@ Property / DOI: 10.1007/S10878-006-9001-0 / rank @@
+Normal rank