On the Minimization of Completion Time Variance with a Bicriteria Extension
On the Minimization of Completion Time Variance with a Bicriteria Extension
About this item
Full title
Author / Creator
Publisher
Linthicum, MD: INFORMS
Journal title
Language
English
Formats
Publication information
Publisher
Linthicum, MD: INFORMS
Subjects
More information
Scope and Contents
Contents
We discuss a single-machine scheduling problem where the objective is to minimize the variance of job completion times. To date, the problem has not been solved in polynomial time. This paper presents a dynamic programming algorithm that is pseudopolynomial in complexity. We also propose a fully polynomial approximation scheme and derive a lower bo...
Alternative Titles
Full title
On the Minimization of Completion Time Variance with a Bicriteria Extension
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_pascalfrancis_primary_4528130
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_pascalfrancis_primary_4528130
Other Identifiers
ISSN
0030-364X
E-ISSN
1526-5463
DOI
10.1287/opre.40.6.1148
