Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2003.10.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2090799175
@@ Property / OpenAlex ID: W2090799175 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2734595
@@ Property / cites work: Q2734595 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+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 / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of scheduling with fixed jobs
@@ Property / cites work: Approximability of scheduling with fixed jobs / rank @@
+Normal rank