Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885): Difference between revisions

@@ Property / cites work @@
+Single facility multi-class job scheduling
@@ Property / cites work: Single facility multi-class job scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
+Normal rank
@@ Property / cites work @@
+Sequencing with Earliness and Tardiness Penalties: A Review
+Normal rank
@@ Property / cites work @@
+The perfectly matchable subgraph polytope of an arbitrary graph
+Normal rank
@@ Property / cites work @@
+Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
+Normal rank
@@ Property / cites work @@
+An inexact algorithm for the sequential ordering problem
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling Polyhedra with Precedence Constraints
+Normal rank