Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008): 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/s00453-008-9248-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2093067798
@@ Property / OpenAlex ID: W2093067798 / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine flow-time scheduling with a single breakdown
+Normal rank
@@ Property / cites work @@
+Scheduling Problems with Two Competing Agents
@@ Property / cites work: Scheduling Problems with Two Competing Agents / rank @@
+Normal rank
@@ Property / cites work @@
+Minimization of Half-Products
@@ Property / cites work: Minimization of Half-Products / rank @@
+Normal rank
@@ Property / cites work @@
+Non-preemptive two-machine open shop scheduling with non-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 @@
+Positive half-products and scheduling with controllable processing times
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
+Normal rank
@@ Property / cites work @@
+New results on the completion time variance minimization
+Normal rank
@@ Property / cites work @@
+Minimization of ordered, symmetric half-products
@@ Property / cites work: Minimization of ordered, symmetric half-products / rank @@
+Normal rank
@@ Property / cites work @@
+Machine scheduling with an availability constraint
+Normal rank
@@ Property / cites work @@
+The quadratic knapsack problem -- a survey
@@ Property / cites work: The quadratic knapsack problem -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling with availability constraints to minimize total weighted completion times
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank