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

Michael X. Weng; Jose A. Ventura

doi:10.1016/0167-6377(94)90079-5

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

Michael X. Weng
, Jose A. Ventura

Harold and Inge Marcus Department of Industrial and Manufacturing Engineering

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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. We propose an integer programming formulation and a Lagrangian solution procedure to approximately solve the tightly restricted version of the MSD problem.

Original language	English (US)
Pages (from-to)	205-211
Number of pages	7
Journal	Operations Research Letters
Volume	15
Issue number	4
DOIs	https://doi.org/10.1016/0167-6377(94)90079-5
State	Published - May 1994

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/0167-6377(94)90079-5

Cite this

@article{1479e394bd86477c8d10f2bf805fba9c,

title = "A quadratic integer programming method for minimizing the mean squared deviation of completion times",

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. We propose an integer programming formulation and a Lagrangian solution procedure to approximately solve the tightly restricted version of the MSD problem.",

author = "Weng, \{Michael X.\} and Ventura, \{Jose A.\}",

year = "1994",

month = may,

doi = "10.1016/0167-6377(94)90079-5",

language = "English (US)",

volume = "15",

pages = "205--211",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

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

AU - Weng, Michael X.

AU - Ventura, Jose A.

PY - 1994/5

Y1 - 1994/5

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/38149147776

UR - https://www.scopus.com/pages/publications/38149147776#tab=citedBy

U2 - 10.1016/0167-6377(94)90079-5

DO - 10.1016/0167-6377(94)90079-5

M3 - Article

AN - SCOPUS:38149147776

SN - 0167-6377

VL - 15

SP - 205

EP - 211

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this