Flow shop scheduling problem with conflict graphs (Q1708533): Difference between revisions

@@ Property / cites work @@
+The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
+Normal rank
@@ Property / cites work @@
+Mutual exclusion scheduling
@@ Property / cites work: Mutual exclusion scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling jobs on identical machines with agreement graph
+Normal rank
@@ Property / cites work @@
+Scheduling: agreement graph vs resource constraints
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Q3821925
@@ Property / cites work: Q3821925 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3470246
@@ Property / cites work: Q3470246 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with incompatible jobs
@@ Property / cites work: Scheduling with incompatible jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Some efficient heuristic methods for the flow shop sequencing problem
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with conflicts: Online and offline algorithms
+Normal rank
@@ Property / cites work @@
+Mutual exclusion scheduling with interval graphs or related classes. I
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Solving the path cover problem on circular-arc graphs by using an approximation algorithm
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A General Bounding Scheme for the Permutation Flow-Shop Problem
+Normal rank
@@ Property / cites work @@
+Permutation vs. non-permutation flow shop schedules
+Normal rank
@@ Property / cites work @@
+Some new results in flow shop scheduling
@@ Property / cites work: Some new results in flow shop scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A note on greedy algorithms for the maximum weighted independent set problem
+Normal rank
@@ Property / cites work @@
+Scheduling unit-time tasks in renewable resource constrained flowshops
+Normal rank
@@ Property / cites work @@
+Open shop scheduling problems with conflict graphs
+Normal rank