Library

eCommons

 

Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms

Simple item page
dc.contributor.authorHall, L. A.en_US
dc.contributor.authorSchulz, A. S.en_US
dc.contributor.authorShmoys, D. B.en_US
dc.contributor.authorWein, J.en_US
dc.date.accessioned2007-11-09T20:37:11Z
dc.date.available2007-11-09T20:37:11Z
dc.date.issued1996-06en_US
dc.description.abstractScheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithmsen_US
dc.format.extent352625 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation1159en_US
dc.identifier.urihttps://hdl.handle.net/1813/9043
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleScheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithmsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR001159.pdf
Size:
344.36 KB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports