On scheduling with ready times to minimize mean flow time

Research output: Contribution to journalArticle

34 Scopus citations

Abstract

An algorithm for sequencing jobs on a single processor with the objective of minimizing the mean flow time, when the jobs may have unequal ready times, is developed. The procedure involves partitioning the problem into subproblems, and solving the subproblems by applying branch and bound techniques. Experimental evaluation shows that the resulting procedure when the partitioning scheme is applied is more efficient than existing algorithms.

Original languageEnglish (US)
Pages (from-to)320-328
Number of pages9
JournalComputer Journal
Volume26
Issue number4
DOIs
Publication statusPublished - Nov 1 1983

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this