共 15 条
[1]
Aho, Hopcroft, Ullman, The Design and Analysis of Computer Algorithms, (1974)
[2]
Blazewicz, Scheduling dependent tasks with different arrival times to meet deadlines, Modelling and Performance Evaluation of Computer Systems, pp. 57-65, (1977)
[3]
Blazewicz, Simple algorithms for multiprocessor scheduling to meet deadlines, Information Processing Letters, 6, 3, pp. 162-164, (1977)
[4]
Blazewicz, Deadline scheduling of tasks — a survey, Foundations of Control Engineering, 1, 4, pp. 203-216, (1977)
[5]
Blazewicz, Scheduling with deadlines and resource constraints, (1977)
[6]
Brucker, Sequencing unit-time jobs with treelike precedence on m machines to minimize maximum lateness, Proc. IX Internat. Symposium on Mathematical Programming, (1976)
[7]
Brucker, Garey, Johnson, Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness, Math. Operations Res., 2, 3, pp. 275-284, (1977)
[8]
Coffman, Computer and Job/Shop Scheduling Theory, (1976)
[9]
Garey, Johnson, Scheduling tasks with nonuniform deadlines on two processors, J. ACM, 23, 3, pp. 461-467, (1976)
[10]
Garey, Johnson, Two-processor scheduling with start-times and deadlines, SIAM Journal on Computing, 6, pp. 416-426, (1977)