Pages that link to "Item:Q4427378"
From MaRDI portal
The following pages link to An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine (Q4427378):
Displayed 11 items.
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- Scheduling jobs on a single machine to maximize the total revenue of jobs (Q954056) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838) (← links)
- The single machine weighted mean squared deviation problem (Q1753598) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)