An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438): Difference between revisions

@@ Property / author @@
-Cheng, T. C. Edwin
@@ Property / author: Cheng, T. C. Edwin / rank @@
-Normal rank
@@ Property / author @@
+Cheng, T. C. Edwin
@@ Property / author: Cheng, T. C. Edwin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2120200272
@@ Property / OpenAlex ID: W2120200272 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling under a grade of service provision
+Normal rank
@@ Property / cites work @@
+An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
+Normal rank
@@ Property / cites work @@
+Parallel-machine scheduling with simple linear deterioration to minimize total completion time
+Normal rank
@@ Property / cites work @@
+Online Scheduling on Parallel Machines with Two GoS Levels
+Normal rank
@@ Property / cites work @@
+Optimal online algorithms for scheduling on two identical machines under a grade of service
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
+Normal rank
@@ Property / cites work @@
+Online and semi-online scheduling of two machines under a grade of service provision
+Normal rank