The complexity of mean flow time scheduling problems with release times (Q880590): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-006-0006-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1964568645
@@ Property / OpenAlex ID: W1964568645 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Properties of optimal schedules in preemptive shop scheduling
+Normal rank
@@ 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 @@
+Minimizing mean flow time with release time constraint
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+On the complexity of minimizing the number of late jobs in unit time open shop
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling to minimize mean weighted flow time
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+Minimizing the total completion time in a unit-time open shop with release times
+Normal rank