Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230): Difference between revisions

@@ Property / cites work @@
+A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs
+Normal rank
@@ Property / cites work @@
+A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper 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 @@
+Q3470246
@@ Property / cites work: Q3470246 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling subject to resource constraints: Classification and complexity
+Normal rank
@@ Property / cites work @@
+Restrictions of graph partition problems. I
@@ Property / cites work: Restrictions of graph partition problems. I / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
+Normal rank
@@ Property / cites work @@
+A New Heuristic for Three-Machine Flow Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Scheduling with conflicts: Online and offline algorithms
+Normal rank
@@ Property / cites work @@
+Bounds for Multiprocessor Scheduling with Resource Constraints
+Normal rank
@@ Property / cites work @@
+Complexity Results for Multiprocessor Scheduling under Resource Constraints
+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 @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Nontrivial path covers of graphs: existence, minimization and maximization
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Approximability of flow shop scheduling
@@ Property / cites work: Approximability of flow shop scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Multicoloring trees.
@@ Property / cites work: Multicoloring trees. / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+HAMILTONian circuits in chordal bipartite graphs
@@ Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The two-equal-disjoint path cover problem of matching composition network
+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 @@
+Scheduling unit-time tasks in renewable resource constrained flowshops
+Normal rank
@@ Property / cites work @@
+Flow shop scheduling problem with conflict graphs
@@ Property / cites work: Flow shop scheduling problem with conflict graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Short Shop Schedules
@@ Property / cites work: Short Shop Schedules / rank @@
+Normal rank