A GRASP for a difficult single machine scheduling problem (Q1184452): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
+Normal rank
@@ Property / cites work @@
+Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
+Normal rank
@@ Property / cites work @@
+Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
+Normal rank
@@ Property / cites work @@
+Semi-greedy heuristics: An empirical study
@@ Property / cites work: Semi-greedy heuristics: An empirical study / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic heuristic for a computationally difficult set covering problem
+Normal rank
@@ Property / cites work @@
+A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
+Normal rank
@@ Property / cites work @@
+Note—Operations Sequencing in Discrete Parts Manufacturing
+Normal rank
@@ Property / cites work @@
+Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
+Normal rank