An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-006-7039-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2061109544
@@ Property / OpenAlex ID: W2061109544 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885495
@@ Property / cites work: Q3885495 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling equal-length jobs on identical parallel machines
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+Q4247460
@@ Property / cites work: Q4247460 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal assignment of due-dates for preemptive single-machine scheduling
+Normal rank
@@ Property / cites work @@
+Q3993992
@@ Property / cites work: Q3993992 / rank @@
+Normal rank
@@ Property / cites work @@
+One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Q3217922
@@ Property / cites work: Q3217922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of the single machine total tardiness problem
+Normal rank