Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249): Difference between revisions

@@ Property / cites work @@
+Open shop problems with unit time operations
@@ Property / cites work: Open shop problems with unit time operations / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\)
+Normal rank
@@ Property / cites work @@
+Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
+Normal rank