Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Dutton:1982:CMT,
author = "R. D. Dutton and R. C. Brigham",
title = "The complexity of a multiprocessor task assignment
problem without deadlines",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "213--216",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Central Florida,
Orlando, FL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; deadlines;
decision problem; decision theory and analysis;
multiprocessing systems; multiprocessor; task
assignment problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}