Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Deogun:1983:SRT, author = "J. S. Deogun", title = "On Scheduling with Ready Times to Minimize Mean Flow Time", journal = j-COMP-J, volume = "26", number = "4", pages = "320--328", month = nov, year = "1983", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/26.4.320", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", MRclass = "90B35", MRnumber = "85c:90040", bibdate = "Tue Dec 4 14:48:15 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/26/4.toc; http://www.math.utah.edu/pub/tex/bib/compj1980.bib; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/", URL = "http://comjnl.oxfordjournals.org/content/26/4/320.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/320.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/321.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/322.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/323.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/324.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/325.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/326.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/327.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_26/Issue_04/tiff/328.tif", acknowledgement = ack-nhfb, classcodes = "C1290F (Systems theory applications in industry)", classification = "722; 723; 913", corpsource = "Dept. of Computer Sci., Univ. of Nebraska, Lincoln, NE, USA", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "branch and bound techniques; computer programming --- Algorithms; computer systems, digital; mean flow time; partitioning; scheduling; sequencing jobs", treatment = "T Theoretical or Mathematical", }