Minimizing total tardiness on parallel machines with preemptions (Q2434279): 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.1007/s10951-010-0198-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2000325475
@@ Property / OpenAlex ID: W2000325475 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of mean flow time scheduling problems with release times
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+On a parallel machine scheduling problem with equal processing times
+Normal rank
@@ Property / cites work @@
+Q3217922
@@ Property / cites work: Q3217922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4124332
@@ Property / cites work: Q4124332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3339651
@@ Property / cites work: Q3339651 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
+Normal rank