Scheduling independent tasks to reduce mean finishing time

doi:10.1145/361011.361064

Scheduling independent tasks to reduce mean finishing time

Full Text:

PDF

Buy this Article

Authors:	J. Bruno	Pennsylvania State Univ., University Park
	E. G. Coffman, Jr.	Pennsylvania State Univ., University Park
	R. Sethi	Pennsylvania State Univ., University Park

Published in:

	· Magazine
	Communications of the ACM CACM Homepage archive
	Volume 17 Issue 7, July 1974 Pages 382-387 ACM New York, NY, USA table of contents doi>10.1145/361011.361064

	1974 Article
Bibliometrics
· Downloads (6 Weeks): 15 · Downloads (12 Months): 101 · Downloads (cumulative): 1,419 · Citation Count: 76

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms deterministic scheduling models minimizing mean finishing time minimizing mean flow time optimal scheduling algorithms scheduling sequencing algorithms sequencing and scheduling

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 Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder