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.
Title
Conditional Scheduling with Varying Deadlines
Published
2002-12-13
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-02-1220
Type
Text
Extent
31 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
