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. We propose an integer programming formulation and a Lagrangian solution procedure to approximately solve the tightly restricted version of the MSD problem.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics