Approximation schemes for parallel machine scheduling with availability constraints (Q642981): Difference between revisions

@@ Property / cites work @@
+Single machine flow-time scheduling with a single breakdown
+Normal rank
@@ Property / cites work @@
+Scheduling preemptable tasks on parallel processors with limited availability
+Normal rank
@@ Property / cites work @@
+Non-preemptive two-machine open shop scheduling with non-availability constraints
+Normal rank
@@ Property / cites work @@
+Q3181697
@@ Property / cites work: Q3181697 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633879
@@ Property / cites work: Q4633879 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential inapproximability and FPTAS for scheduling with availability constraints
+Normal rank
@@ Property / cites work @@
+MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
+Normal rank
@@ Property / cites work @@
+Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
+Normal rank
@@ Property / cites work @@
+Q3883902
@@ Property / cites work: Q3883902 / rank @@
+Normal rank
@@ Property / cites work @@
+Machine scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with scheduled maintenance
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with machine availability and eligibility constraints
+Normal rank
@@ Property / cites work @@
+Approximability of scheduling with fixed jobs
@@ Property / cites work: Approximability of scheduling with fixed jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling with limited machine availability
@@ Property / cites work: Scheduling with limited machine availability / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of single machine scheduling with fixed jobs to minimize total completion time
+Normal rank