Scheduling tasks on two processors with deadlines and additional resources
暂无分享,去创建一个
Wieslaw Kubiak | Jacek Blazewicz | J. Barcelo | H. Röck | J. Blazewicz | W. Kubiak | J. Barceló | H. Röck | J. Błażewicz
[1] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .
[2] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Craig A. Tovey,et al. A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..
[5] D. de Werra,et al. Preemptive Scheduling, Linear Programming and Network Flows , 1984 .
[6] Salah E. Elmaghraby,et al. Activity networks: Project planning and control by network models , 1977 .
[7] Jacek Blazewicz,et al. Deadline Scheduling of Tasks with Ready Times and Resource Constraints , 1979, Inf. Process. Lett..
[8] Hans Röck,et al. Some new results in flow shop scheduling , 1984, Z. Oper. Research.
[9] J. Baewicz,et al. A linear time algorithm for restricted bin packing and scheduling problems , 1983 .
[10] Wojciech Cellary,et al. Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] , 1977, TOMS.
[11] Wieslaw Kubiak,et al. Minimizing mean flow-time with parallel processors and resource constraints , 1987, Acta Informatica.
[12] Jan Karel Lenstra,et al. Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..
[13] Jan Karel Lenstra,et al. Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .
[14] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[15] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .