Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040): Difference between revisions

@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
+Normal rank
@@ Property / cites work @@
+A branch \(\&\) bound algorithm for the open-shop problem
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the job-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+An Algorithm for Solving the Job-Shop Problem
@@ Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Adjustment of heads and tails for the job-shop problem
+Normal rank
@@ Property / cites work @@
+Q4386920
@@ Property / cites work: Q4386920 / rank @@
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+A block approach for single-machine scheduling with release dates and due dates
+Normal rank
@@ Property / cites work @@
+Classical and new heuristics for the open-shop problem: A computational evaluation
+Normal rank
@@ Property / cites work @@
+Q4353615
@@ Property / cites work: Q4353615 / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarks for basic scheduling problems
@@ Property / cites work: Benchmarks for basic scheduling problems / rank @@
+Normal rank