Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2009.05.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2059491425
@@ Property / OpenAlex ID: W2059491425 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Complexity results for single-machine problems with positive finish-start time-lags
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+The complexity of mean flow time scheduling problems with release times
+Normal rank
@@ Property / cites work @@
+Minimizing mean flow time with release time constraint
+Normal rank
@@ Property / cites work @@
+Q3339651
@@ Property / cites work: Q3339651 / rank @@
+Normal rank