Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints (Q2439528): Difference between revisions

@@ Property / cites work @@
+The complexity of short schedules for uet bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-dependent scheduling
@@ Property / cites work: Time-dependent scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling linearly shortening jobs under precedence constraints
+Normal rank
@@ Property / cites work @@
+Scheduling time-dependent jobs under mixed deterioration
+Normal rank
@@ Property / cites work @@
+Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
+Normal rank
@@ Property / cites work @@
+Q4242389
@@ Property / cites work: Q4242389 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Scheduling jobs under simple linear deterioration
@@ Property / cites work: Scheduling jobs under simple linear deterioration / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
+Normal rank