Pages that link to "Item:Q1600838"
From MaRDI portal
The following pages link to Fast fully polynomial approximation schemes for minimizing completion time variance (Q1600838):
Displaying 15 items.
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← links)
- A lower bound for weighted completion time variance (Q613431) (← links)
- A half-product based approximation scheme for agreeably weighted completion time variance (Q707130) (← links)
- Job scheduling methods for reducing waiting time variance (Q878584) (← links)
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS (Q3197622) (← links)
- On the Minimization of Completion Time Variance with a Bicriteria Extension (Q4032593) (← links)
- Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)
