A quadratic integer programming method for minimizing the mean squared deviation of completion times

A quadratic integer programming method for minimizing the mean squared deviation of completion times

0.00 Avg rating—0 Votes
Article ID: iaor19951488
Country: Netherlands
Volume: 15
Issue: 4
Start Page Number: 205
End Page Number: 211
Publication Date: Apr 1994
Journal: Operations Research Letters
Authors: ,
Keywords: scheduling
Abstract:

The problem of minimizing the mean squared deviation (MSD) of job completion times about a given common due date in n-job, single-machine scheduling is considered. The authors propose an integer programming formulation and a Lagrangean solution procedure to approximately solve the tightly restricted version of the MSD problem.

Reviews

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