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

Michael X. Weng, Jose Antonio Ventura

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish (US)
Pages (from-to)205-211
Number of pages7
JournalOperations Research Letters
Volume15
Issue number4
DOIs
StatePublished - Jan 1 1994

Fingerprint

Integer programming
Completion Time
Integer Programming
Quadratic Programming
Deviation
Scheduling
Common Due Date
Single Machine Scheduling
Formulation
Single machine scheduling
Due dates

All Science Journal Classification (ASJC) codes

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

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 Antonio}",
year = "1994",
month = "1",
day = "1",
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",
number = "4",

}

A quadratic integer programming method for minimizing the mean squared deviation of completion times. / Weng, Michael X.; Ventura, Jose Antonio.

In: Operations Research Letters, Vol. 15, No. 4, 01.01.1994, p. 205-211.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Weng, Michael X.

AU - Ventura, Jose Antonio

PY - 1994/1/1

Y1 - 1994/1/1

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 - http://www.scopus.com/inward/record.url?scp=38149147776&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149147776&partnerID=8YFLogxK

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

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

M3 - Article

AN - SCOPUS:38149147776

VL - 15

SP - 205

EP - 211

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -