Scheduling to minimize the coefficient of variation

dc.citation.epage253en_US
dc.citation.issueNumber3en_US
dc.citation.spage249en_US
dc.citation.volumeNumber44en_US
dc.contributor.authorDe, P.en_US
dc.contributor.authorGhosh, J. B.en_US
dc.contributor.authorWells, C. E.en_US
dc.date.accessioned2016-02-08T10:50:35Z
dc.date.available2016-02-08T10:50:35Z
dc.date.issued1996en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractIn this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We first show that, for high processing time values of the longest job, a variance (V) minimizing schedule also minimizes CV. Using this equivalence, we next demonstrate the invalidity of an earlier conjecture about the structure of a CV-optimal schedule and proceed to establish the NP-hardness of the CV problem. Finally, drawing from our prior work on the V problem, we provide a pseudo-polynomial dynamic programming algorithm for the solution of the CV problem.en_US
dc.identifier.doi10.1016/0925-5273(96)00056-4en_US
dc.identifier.issn0925-5273
dc.identifier.urihttp://hdl.handle.net/11693/25800
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0925-5273(96)00056-4en_US
dc.source.titleInternational Journal of Production Economicsen_US
dc.subjectAlgorithmsen_US
dc.subjectComplexityen_US
dc.subjectMachine schedulingen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectDynamic programmingen_US
dc.subjectEquivalence classesen_US
dc.subjectMachineryen_US
dc.subjectOptimizationen_US
dc.subjectPolynomialsen_US
dc.subjectProblem solvingen_US
dc.subjectVariational techniquesen_US
dc.subjectCoefficient of variationen_US
dc.subjectMachine schedulingen_US
dc.subjectPseudo polynomial dynamic programming algorithmen_US
dc.subjectSchedulingen_US
dc.titleScheduling to minimize the coefficient of variationen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Scheduling to minimize the coefficient of variation.pdf
Size:
385.53 KB
Format:
Adobe Portable Document Format
Description:
Full printable version