Scheduling unit — time tasks on flow — shops under resource constraints
暂无分享,去创建一个
J. Błażewicz | W. Kubiak | J. Szwarcfiter | J. Blazewicz | W. Kubiak | J. Szwarcfiter | J. Błażewicz
[1] Jacek Blazewicz,et al. Scheduling under resource constraints - deterministic models , 1986 .
[2] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[3] Jacek Blazewicz,et al. Deadline Scheduling of Tasks with Ready Times and Resource Constraints , 1979, Inf. Process. Lett..
[4] Hans Röck,et al. Some new results in flow shop scheduling , 1984, Z. Oper. Research.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Wieslaw Kubiak,et al. Minimizing mean flow-time with parallel processors and resource constraints , 1987, Acta Informatica.
[7] Wieslaw Kubiak,et al. Scheduling tasks on two processors with deadlines and additional resources , 1986 .
[8] D. de Werra,et al. Preemptive Scheduling, Linear Programming and Network Flows , 1984 .
[9] Jan Karel Lenstra,et al. Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..
[10] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .