A note on lower bound for completion time variance in single machine scheduling

A note on lower bound for completion time variance in single machine scheduling

0.00 Avg rating0 Votes
Article ID: iaor1999188
Country: India
Volume: 34
Issue: 4
Start Page Number: 277
End Page Number: 282
Publication Date: Dec 1997
Journal: OPSEARCH
Authors: , ,
Keywords: statistics: general
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. is corrected using a simple proof. Computational results on the lower bound are also provided.

Reviews

Required fields are marked *. Your email address will not be published.