Thumbnail
Access Restriction
Subscribed

Author Sethi, R. ♦ Bruno, J. ♦ Coffman, E. G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Minimizing mean flow time ♦ Optimal scheduling algorithms ♦ Deterministic scheduling models ♦ Minimizing mean finishing time ♦ Sequencing algorithms
Abstract Sequencing to minimize mean finishing time (or mean time in system) is not only desirable to the user, but it also tends to minimize at each point in time the storage required to hold incomplete tasks. In this paper a deterministic model of independent tasks is introduced and new results are derived which extend and generalize the algorithms known for minimizing mean finishing time. In addition to presenting and analyzing new algorithms it is shown that the most general mean-finishing-time problem for independent tasks is polynomial complete, and hence unlikely to admit of a non-enumerative solution.
Description Affiliation: Pennsylvania State Univ., University Park (Bruno, J.; Coffman, E. G.; Sethi, R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 7
Page Count 6
Starting Page 382
Ending Page 387


Open content in new tab

   Open content in new tab
Source: ACM Digital Library