Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906): Difference between revisions

@@ Property / cites work @@
+Q3211098
@@ Property / cites work: Q3211098 / rank @@
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
+Normal rank
@@ Property / cites work @@
+An iterative heuristic for the single machine dynamic total completion time scheduling problem
+Normal rank
@@ Property / cites work @@
+Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
+Normal rank
@@ Property / cites work @@
+On n/1/?? dynamic deterministic problems
@@ Property / cites work: On n/1/?? dynamic deterministic problems / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient heuristics to minimize total flow time with release dates
+Normal rank
@@ Property / cites work @@
+Q3993992
@@ Property / cites work: Q3993992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4017560
@@ Property / cites work: Q4017560 / rank @@
+Normal rank
@@ Property / cites work @@
+A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective heuristics for the single machine sequencing problem with ready times
+Normal rank