A hybrid heuristic approach for single machine scheduling with release times (Q336949): Difference between revisions

@@ Property / cites work @@
+Q4017560
@@ Property / cites work: Q4017560 / rank @@
+Normal rank
@@ Property / cites work @@
+Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A matheuristic approach for the two-machine total completion time flow shop problem
+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 @@
+Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
+Normal rank
@@ Property / cites work @@
+An algorithm for single machine sequencing with release dates to minimize total weighted completion time
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+Dominance-based heuristics for one-machine total cost scheduling problems
+Normal rank
@@ Property / cites work @@
+Matheuristics
@@ Property / cites work: Matheuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
+Normal rank
@@ Property / cites work @@
+Revisiting branch and bound search strategies for machine scheduling problems
+Normal rank
@@ Property / cites work @@
+A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
+Normal rank