Two-Processor Scheduling with Start-Times and Deadlines
نویسندگان
چکیده
منابع مشابه
Two-Processor Scheduling with Start-Times and Deadlines
Given a set 3-= {T1, T2, , T,} of tasks, each T/having execution time 1, an integer start-time si-> 0 and a deadline di> 0, along with precedence constraints among the tasks, we examine the problem of determining whether there exists a schedule on two identical processors that executes each task in the time interval between its start-time and deadline. We present an O(n 3) algorithm that constr...
متن کاملScheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
In this paper we study the feasibility problem of scheduling a set of start time dependent tasks on a single machine with deadlines, processing rates and identical initial processing times. First, we show that the cases with arbitrary deadlines are strongly NP-complete. Second, we show that the cases with two distinct deadlines are NP-complete in the ordinary sense. Finally, we give an optimal ...
متن کاملScheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations
We present an algorithm that finds an optimal schedule on a single processor for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline, and a given set of precedence relations and a given set of exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the i...
متن کاملSingle machine scheduling with forbidden start times
This paper addresses a single machine scheduling problem in which the following simple constraint is added: a set of time slots is forbidden for starting a task, that is no task can start at any forbidden time point. We show that the single machine problem with makespan minimization is strongly NP-complete and we give polynomial algorithms to solve the problems with a small number of forbidden ...
متن کاملOnline Scheduling with Hard Deadlines
We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be star...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1977
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0206029