Permutation polyhedra and minimisation of the variance of completion times on a single machine

Journal of Heuristics

Volumn 8, Issue 4, 2002, Pages 467-485

  Sharma, Prabha ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Completion time variance; Dominance; Dominance value; Permutation polyhedra

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS;

COMPLETION TIME VARIANCE (CTV) PROBLEMS;

PROBLEM SOLVING;

EID: 0036644620     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015496114938     Document Type: Article

References (14)

1. Permutation polyhedra
2. On the minimisation of completion time variance with a bi-criteria extension
3. Minimising waiting time variance in the single machine problem
4. Adjacent vertices on a permutohedron
5. Minimising the flow-time variance in single-machine systems
6. Proof of a conjecture of schrage about the completion time variance problem
7. Minimising variance of flow time in single machine sequencing problems
8. Completion time variance on single machine is difficult
9. New results on the completion time variance minimisation
10. Variance minimisation in single machine sequencing problems
11. V-shaped policies for scheduling deteriorating jobs
12. Minimising the time-in-system variance for a finite jobset
13. Deterministic and random single machine sequencing with variance minimisation