Lower bound for the single-machine completion time variance problem

Jose A. Ventura; Xiaohua Weng; Chih Hang Wu

Lower bound for the single-machine completion time variance problem

Jose A. Ventura, Xiaohua Weng, Chih Hang Wu

Marcus Department of Industrial and Manufacturing Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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 language	English (US)
Title of host publication	Proceedings of the Industrial Engineering Research Conference
Editors	Deborah A. Mitta, Laura I. Burke, John R. English, Jennie Gallimore, Georgia-Ann Klutke, Gregory L. Tonkay
Publisher	Publ by IIE
Pages	847-852
Number of pages	6
ISBN (Print)	0898061326
State	Published - 1993
Event	Proceedings of the 2nd Industrial Engineering Research Conference - Los Angeles, CA, USA Duration: May 26 1993 → May 28 1993

Publication series

Name	Proceedings of the Industrial Engineering Research Conference

Other

Other	Proceedings of the 2nd Industrial Engineering Research Conference
City	Los Angeles, CA, USA
Period	5/26/93 → 5/28/93

All Science Journal Classification (ASJC) codes

General Engineering

Cite this

Ventura, Jose A. ; 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 (Proceedings of the Industrial Engineering Research Conference).

@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 A.} and Xiaohua Weng and Wu, {Chih Hang}",

year = "1993",

language = "English (US)",

isbn = "0898061326",

series = "Proceedings of the Industrial Engineering Research Conference",

publisher = "Publ by IIE",

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",

note = "Proceedings of the 2nd Industrial Engineering Research Conference ; Conference date: 26-05-1993 Through 28-05-1993",

}

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. 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 A.; 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 (Proceedings of the Industrial Engineering Research Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Ventura, Jose A.

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

AN - SCOPUS:0027812818

SN - 0898061326

T3 - Proceedings of the Industrial Engineering Research Conference

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

T2 - Proceedings of the 2nd Industrial Engineering Research Conference

Y2 - 26 May 1993 through 28 May 1993

ER -

Lower bound for the single-machine completion time variance problem

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this