Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904): Difference between revisions

@@ Property / cites work @@
+Minimizing mean absolute deviation of completion times about a common due date
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Q4131987
@@ Property / cites work: Q4131987 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3793928
@@ Property / cites work: Q3793928 / rank @@
+Normal rank
@@ Property / cites work @@
+One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
+Normal rank
@@ Property / cites work @@
+Single- and multiple-processor models for minimizing completion time variance
+Normal rank
@@ Property / cites work @@
+Minimizing the average deviation of job completion times about a common due date
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
+Normal rank