Pages that link to "Item:Q3569281"
From MaRDI portal
The following pages link to MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK (Q3569281):
Displayed 13 items.
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection (Q2331597) (← links)
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
