|
Volumn 48, Issue 6, 1993, Pages 315-320
|
Complexity of scheduling tasks with time-dependent execution times
a a a |
Author keywords
Algorithms; Deadline; Feasible schedule; Nonpreemptive schedule; NP complete; Polynomial time algorithm; Release time; Single processor
|
Indexed keywords
ALGORITHMS;
MATHEMATICAL MODELS;
MILITARY APPLICATIONS;
POLYNOMIALS;
TIME VARYING NETWORKS;
DEADLINE;
FEASIBILITY PROBLEM;
FEASIBLE SCHEDULE;
NONPREEMPTIVE SCHEDULES;
RELEASE TIME;
SINGLE PROCESSOR;
SCHEDULING;
|
EID: 0027885153
PISSN: 00200190
EISSN: None
Source Type: Journal
DOI: 10.1016/0020-0190(93)90175-9 Document Type: Article |
Times cited : (92)
|
References (7)
|