ACM Home Page
Please provide us with feedback. Feedback
Scheduling Independent Tasks with Due Times on a Uniform Processor System
Full text PdfPdf (862 KB)
Source Journal of the ACM (JACM) archive
Volume 27 ,  Issue 3  (July 1980) table of contents
Pages: 550 - 563  
Year of Publication: 1980
ISSN:0004-5411
Authors
Sartaj Sahni  Department of Computer Science, University of Minnesota, 136 Lind Hall, 207 Church St., SE, Minneapolis, MN
Yookun Cho  Computer Science Department, Seoul National University, Seoul, Korea and University of Minnesota, Minneapolis, Minnesota
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 33,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322203.322214
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BRUNO, J., AND GONZALEZ, T. Scheduling independent tasks with release dates and due dates on parallel machines Tech. Rep. No. 213, Pennsylvania State U., University Park, Pa., Dec. 1976.
2
 
3
HORN, W. Some simple scheduling algorithms. Nay. Res. Log. Qtr. 21 (1974), 177-185.
 
4
LIu, J., AND LIU, C. Bounds on scheduling algorithms for heterogeneous computing systems. In Information Processing 1974, North Holland, Amsterdam, pp. 349-353.
 
5
SAHNI, S. Preemptive scheduling with due dates. Oper. Research 27, 5 (Sept.-Oct. 1979), 925-934.


Collaborative Colleagues:
Sartaj Sahni: colleagues
Yookun Cho: colleagues