An efficient job scheduling algorithm for mixed turnaround and deadline applications
dc.contributor.author | Das, K. Sundar | en_US |
dc.contributor.author | Teorey, Toby J. | en_US |
dc.date.accessioned | 2006-04-07T16:58:01Z | |
dc.date.available | 2006-04-07T16:58:01Z | |
dc.date.issued | 1978-11 | en_US |
dc.identifier.citation | Das, K. Sundar, Teorey, Toby J. (1978/11)."An efficient job scheduling algorithm for mixed turnaround and deadline applications." Information Sciences 16(2): 137-149. <http://hdl.handle.net/2027.42/22493> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V0C-48MYPRJ-B5/2/b178376b1dc4c8a6b392f8b2b11dc2f9 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/22493 | |
dc.description.abstract | Computer job scheduling is often performed with little understanding of the formal properties of the jobs being scheduled. One reason for this is that optimal solutions for job scheduling on computers are difficult to obtain if the job stream has mixed objectives, i.e., it consists of some jobs whose turnaround time has to be minimized and others whose deadlines must be met. A practical algorithm for scheduling mixed job streams on monoprogrammed computers, with potential application to a multiprogramming environment, is presented. The algorithm takes into account variable cost rates for each job. Experimental results illustrate the efficiency of the algorithm in terms of both its proximity to optimal solutions and its low computational complexity. | en_US |
dc.format.extent | 731929 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | An efficient job scheduling algorithm for mixed turnaround and deadline applications | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | The University of Michigan, Ann Arbor, Michigan 48109, U.S.A. | en_US |
dc.contributor.affiliationother | University of Texas at San Antonio, San Antonio, Texas 78285, U.S.A. | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/22493/1/0000034.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0020-0255(78)90039-7 | en_US |
dc.identifier.source | Information Sciences | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.