Lower bound for the single-machine completion time variance problem

Jose Antonio Ventura, Xiaohua Weng, Chih Hang Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A new quadratic integer programming (QIP) formulation for the single-machine completion time variance problem (CTVP) is introduced. A Lagrangian relaxation (LR) procedure is developed to find a lower bound (LB) for CTVP. Computational results are presented to examine the performance of the LR procedure.

Original languageEnglish (US)
Title of host publicationProceedings of the Industrial Engineering Research Conference
EditorsDeborah A. Mitta, Laura I. Burke, John R. English, Jennie Gallimore, Georgia-Ann Klutke, Gregory L. Tonkay
PublisherPubl by IIE
Pages847-852
Number of pages6
ISBN (Print)0898061326
StatePublished - 1993
EventProceedings of the 2nd Industrial Engineering Research Conference - Los Angeles, CA, USA
Duration: May 26 1993May 28 1993

Other

OtherProceedings of the 2nd Industrial Engineering Research Conference
CityLos Angeles, CA, USA
Period5/26/935/28/93

Fingerprint

Integer programming

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Ventura, J. A., Weng, X., & Wu, C. H. (1993). Lower bound for the single-machine completion time variance problem. In D. A. Mitta, L. I. Burke, J. R. English, J. Gallimore, G-A. Klutke, & G. L. Tonkay (Eds.), Proceedings of the Industrial Engineering Research Conference (pp. 847-852). Publ by IIE.
Ventura, Jose Antonio ; Weng, Xiaohua ; Wu, Chih Hang. / Lower bound for the single-machine completion time variance problem. Proceedings of the Industrial Engineering Research Conference. editor / Deborah A. Mitta ; Laura I. Burke ; John R. English ; Jennie Gallimore ; Georgia-Ann Klutke ; Gregory L. Tonkay. Publ by IIE, 1993. pp. 847-852
@inproceedings{10a70d53bf624464827b42a0c484e40a,
title = "Lower bound for the single-machine completion time variance problem",
abstract = "A new quadratic integer programming (QIP) formulation for the single-machine completion time variance problem (CTVP) is introduced. A Lagrangian relaxation (LR) procedure is developed to find a lower bound (LB) for CTVP. Computational results are presented to examine the performance of the LR procedure.",
author = "Ventura, {Jose Antonio} and Xiaohua Weng and Wu, {Chih Hang}",
year = "1993",
language = "English (US)",
isbn = "0898061326",
pages = "847--852",
editor = "Mitta, {Deborah A.} and Burke, {Laura I.} and English, {John R.} and Jennie Gallimore and Georgia-Ann Klutke and Tonkay, {Gregory L.}",
booktitle = "Proceedings of the Industrial Engineering Research Conference",
publisher = "Publ by IIE",

}

Ventura, JA, Weng, X & Wu, CH 1993, Lower bound for the single-machine completion time variance problem. in DA Mitta, LI Burke, JR English, J Gallimore, G-A Klutke & GL Tonkay (eds), Proceedings of the Industrial Engineering Research Conference. Publ by IIE, pp. 847-852, Proceedings of the 2nd Industrial Engineering Research Conference, Los Angeles, CA, USA, 5/26/93.

Lower bound for the single-machine completion time variance problem. / Ventura, Jose Antonio; Weng, Xiaohua; Wu, Chih Hang.

Proceedings of the Industrial Engineering Research Conference. ed. / Deborah A. Mitta; Laura I. Burke; John R. English; Jennie Gallimore; Georgia-Ann Klutke; Gregory L. Tonkay. Publ by IIE, 1993. p. 847-852.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Lower bound for the single-machine completion time variance problem

AU - Ventura, Jose Antonio

AU - Weng, Xiaohua

AU - Wu, Chih Hang

PY - 1993

Y1 - 1993

N2 - A new quadratic integer programming (QIP) formulation for the single-machine completion time variance problem (CTVP) is introduced. A Lagrangian relaxation (LR) procedure is developed to find a lower bound (LB) for CTVP. Computational results are presented to examine the performance of the LR procedure.

AB - A new quadratic integer programming (QIP) formulation for the single-machine completion time variance problem (CTVP) is introduced. A Lagrangian relaxation (LR) procedure is developed to find a lower bound (LB) for CTVP. Computational results are presented to examine the performance of the LR procedure.

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

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

M3 - Conference contribution

SN - 0898061326

SP - 847

EP - 852

BT - Proceedings of the Industrial Engineering Research Conference

A2 - Mitta, Deborah A.

A2 - Burke, Laura I.

A2 - English, John R.

A2 - Gallimore, Jennie

A2 - Klutke, Georgia-Ann

A2 - Tonkay, Gregory L.

PB - Publ by IIE

ER -

Ventura JA, Weng X, Wu CH. Lower bound for the single-machine completion time variance problem. In Mitta DA, Burke LI, English JR, Gallimore J, Klutke G-A, Tonkay GL, editors, Proceedings of the Industrial Engineering Research Conference. Publ by IIE. 1993. p. 847-852