On scheduling with ready times to minimize mean flow time

J. S. Deogun

Research output: Contribution to journalArticlepeer-review

34 Scopus citations


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
Issue number4
StatePublished - Nov 1983
Externally publishedYes

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'On scheduling with ready times to minimize mean flow time'. Together they form a unique fingerprint.

Cite this