SIGN IN
SIGN UP
On-line scheduling of a single machine to minimize total weighted completion time
Full Text:
Pdf
Buy this Article
Authors:
E. J. Anderson
University of New South Wales, Sydney, New South Wales 2052, Australia
C. N. Potts
University of Southampton, Southampton SO17 1BJ, U.K.
Published in:
· Proceeding
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2002
table of contents
ISBN:0-89871-513-X
2002 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 26
· Citation Count: 4
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder