Premium
Minimization of expected variance of completion times on single machine for stochastic jobs
Author(s) -
Prasad V. Rajendra,
Manna D. K.
Publication year - 1997
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199702)44:1<97::aid-nav6>3.0.co;2-h
Subject(s) - sequence (biology) , variance (accounting) , minification , single machine scheduling , scheduling (production processes) , expected value , computer science , mathematical optimization , bounded function , due date , job shop scheduling , value (mathematics) , mathematics , algorithm , statistics , schedule , economics , mathematical analysis , genetics , accounting , biology , operating system
This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V‐shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V‐shaped. © 1997 John Wiley & Sons, Inc.