Benjamin Horowitz

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-02-1220
December 2002

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2002/CSD-02-1220.pdf

We examine a conditional scheduling model in which the deadlines of jobs are allowed to vary. We explore variants of the basic model and locate the dividing line between NP-hard and polynomial-time problems.

BibTeX citation:

@techreport{Horowitz:CSD-02-1220,
    Author = {Horowitz, Benjamin},
    Title = {Conditional Scheduling with Varying Deadlines},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2002},
    Month = {Dec},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2002/6189.html},
    Number = {UCB/CSD-02-1220},
    Abstract = {We examine a conditional scheduling model in which the deadlines of jobs are allowed to vary. We explore variants of the basic model and locate the dividing line between NP-hard and polynomial-time problems.}
}

EndNote citation:

%0 Report
%A Horowitz, Benjamin
%T Conditional Scheduling with Varying Deadlines
%I EECS Department, University of California, Berkeley
%D 2002
%@ UCB/CSD-02-1220
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2002/6189.html
%F Horowitz:CSD-02-1220