Abstract
This paper is concerned with the single machine scheduling problem where the objective is to minimize the variance of the job completion times. A lower bound on minimum completion time variance given by De et al. (1992) is corrected using a simple proof. Computational results on the lower bound are also provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BAZARAA M.S., C.M. Shetty, Nonlinear Programming-Theory and Applications, John Wiley, New York, 1979.
CHENG, T.C.E., AND CAI, X., “On the complexity of completion time variance minimization problem”, Asia-Pacific Journal of Operational Research 10 (1993) 109–120.
DE, P., GHOSH, J.B. AND WELLS, C.E., “Scheduling about a common due date with earliness and tardiness penalties”, Computers and Operations Research 17 (1990) 231–241.
DE, P., GHOSH, J.B., AND WELLS, E.E., “On the minimization of completion time variance with a bicriteria extension”, Operations Research 40 (1992) 1148–1155.
KUBIAK, W., “Completion time variance minimization on a single machine is difficult”, Operations Research Letters 14 (1993) 49–59.
Manna, D.K., and Prasad, V.R., “Minimization of completion time variance using a dominance criterion and a lower bound”, Technical Report No. 21 (1994), Studies in Quality and Optimization, Indian Statistical Institute, Madras, India.
Merten, A.G., and Muller, M.E., “Variance minimization in single machine sequencing problems”, Management Science 18 (1972) 518–528.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rajendra Prasad, V., Manna, D.K. & Arthanari, T.S. A Note on Lower Bound for Completition Time Variance in Single Machine Scheduling. OPSEARCH 34, 277–282 (1997). https://doi.org/10.1007/BF03398531
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398531