On scheduling with ready times to minimize mean flow time

Research output: Contribution to journalArticle

34 Citations (Scopus)

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
StatePublished - Nov 1 1983

Fingerprint

Scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

On scheduling with ready times to minimize mean flow time. / Deogun, J. S.

In: Computer Journal, Vol. 26, No. 4, 01.11.1983, p. 320-328.

Research output: Contribution to journalArticle

@article{37eb213e74f84c50ab9dd8a591d68926,
title = "On scheduling with ready times to minimize mean flow time",
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.",
author = "Deogun, {J. S.}",
year = "1983",
month = "11",
day = "1",
doi = "10.1093/comjnl/26.4.320",
language = "English (US)",
volume = "26",
pages = "320--328",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "4",

}

TY - JOUR

T1 - On scheduling with ready times to minimize mean flow time

AU - Deogun, J. S.

PY - 1983/11/1

Y1 - 1983/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020849757&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020849757&partnerID=8YFLogxK

U2 - 10.1093/comjnl/26.4.320

DO - 10.1093/comjnl/26.4.320

M3 - Article

AN - SCOPUS:0020849757

VL - 26

SP - 320

EP - 328

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 4

ER -