Completion time variance minimization on a single machine is difficult

Authors:
Wieslaw Kubiak
Affiliations:
Faculty of Business Administration, Memorial University of Newfoundland, St. John's A1B 3X5, Canada
Venue:
Operations Research Letters
Year:
1993

Citing 5
Cited 11

Deterministic and random single machine sequencing with variance minimization

Operations Research
Simultaneous minimization of mean and variation flow time and waiting in single machine systems

Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
On the minimization of completion time variance with a bicriteria extension

Operations Research
Proof of a conjecture of Schrage about the completion time variance problem

Operations Research Letters

Job scheduling methods for reducing waiting time variance

Computers and Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

Computers and Operations Research
Completion time variance minimization in single machine and multi-machine systems

Computers and Operations Research
Solving a stochastic single machine problem with initial idle time and quadratic objective

Computers and Operations Research
Hierarchical minimization of completion time variance and makespan in jobshops

Computers and Operations Research
Minimization of ordered, symmetric half-products

Discrete Applied Mathematics
Total absolute deviation of job completion times on uniform and unrelated machines

Computers and Operations Research
An efficient local search for minimizing completion time variance in permutation flow shops

Computers and Operations Research
Minimizing weighted waiting time variance on a single processor

Computers and Industrial Engineering
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of the completion time variance minimization (CTV) problem on a single machine has been open since the paper by Merten and Muller (Management Science 18 (1972)). In this paper we prove that the CTV problem is NP-hard.