A note on reverse scheduling with maximum lateness objective (Q398863): Difference between revisions

@@ Property / cites work @@
+Q4826104
@@ Property / cites work: Q4826104 / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse scheduling with maximum lateness objective
+Normal rank
@@ Property / cites work @@
+Minimizing Total Tardiness on One Machine is NP-Hard
+Normal rank
@@ Property / cites work @@
+A faster algorithm for the maximum weighted tardiness problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+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 @@
+Q4124328
@@ Property / cites work: Q4124328 / rank @@
+Normal rank
@@ Property / cites work @@
+Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
+Normal rank
@@ Property / DBLP publication ID @@
+journals/scheduling/LiBNCSY13
@@ Property / DBLP publication ID: journals/scheduling/LiBNCSY13 / rank @@
+Normal rank