Lower bound for the single-machine completion time variance problem

Jose A. Ventura, Xiaohua Weng, Chih Hang Wu

Research output: Chapter in Book/Report/Conference proceedingConference 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 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 - Dec 1 1993
EventProceedings of the 2nd Industrial Engineering Research Conference - Los Angeles, CA, USA
Duration: May 26 1993May 28 1993

Publication series

NameProceedings of the Industrial Engineering Research Conference

Other

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

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Lower bound for the single-machine completion time variance problem'. Together they form a unique fingerprint.

Cite this