### Abstract

The mean flow time of a schedule provides a measure of the average time that a task spends within a computer system, and also the average number of unfinished tasks in the system. The mean flow time of a schedule is defined to be the sum of the finishing times of all tasks in the system. On a system of identical processors O(nlog n) algorithms exist for determining minimal mean flow time schedules for n independent tasks. In general, there will be a large class C of schedules, of widely differing lengths, that all minimize mean flow time. The problem of finding the shortest schedule in C is NP-complete. We give heuristics that find schedules in C that are no more than 25% longer than the shortest schedule in C. The advantage of a short schedule is that processor utilization is high.

Original language | English (US) |
---|---|

Pages (from-to) | 1-14 |

Number of pages | 14 |

Journal | Acta Informatica |

Volume | 6 |

Issue number | 1 |

DOIs | |

Publication status | Published - Mar 1976 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Information Systems

### Cite this

*Acta Informatica*,

*6*(1), 1-14. https://doi.org/10.1007/BF00263740