Fast fully polynomial approximation schemes for minimizing completion time variance

European Journal of Operational Research

Volumn 137, Issue 2, 2002, Pages 303-309

  Kubiak, Wieslaw ^a   Cheng, Jinliang ^a   Kovalyov, Mikhail Y ^b  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

Author keywords

Completion time variance; Fully polynomial approximation scheme; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; TIME VARYING SYSTEMS;

COMPLETION TIME VARIANCES (CTV); ROUNDING TECHNIQUES;

POLYNOMIAL APPROXIMATION;

EID: 0036497504     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00211-9     Document Type: Article

References (15)

1. Minimization of agreeably weighted variance in single machine systems
2. Minimising waiting time variance in the single machine problem
3. On the minimization of completion time variance with a bicriteria extension
4. Proof of a conjecture of Schrage about the completion time variance problem
5. Fast approximation algorithms for the knapsack and sum of subset problems
6. Minimizing variation of flow time in single machine systems
7. A fully polynomial approximation scheme for weighted earliness-tardiness problem
8. Completion time variance minimization on a single machine is difficult
9. New results on the completion time variance minimization
10. Variance minimization in single machine sequencing problems
11. Algorithms for scheduling independent tasks
12. Minimizing the time-in-system variance for a finite jobset
13. An approximation scheme for minimizing agreeably weighted variance on a single machine