Scheduling subject to resource constraints: classification and complexity

Blazewicz, 1979, Deadline scheduling of tasks with ready times and resource constraints, Information Processing Lett., 8, 60, 10.1016/0020-0190(79)90143-1 Conway, 1967 Even, 1975, An O(n2·5) algorithm for maximum matching in general graphs, Proc. 16th Annual IEEE Symp. Foundations of Computer Science, 100 Garey, 1975, Complexity results for multiprocessor scheduling under resource constraints, SIAM J. Comput., 4, 397, 10.1137/0204035 Garey, 1979 Gonzalez, 1978, Preemptive scheduling of uniform processor systems, J. Assoc. Comput. Mach., 25, 92, 10.1145/322047.322055 Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math., 5, 287, 10.1016/S0167-5060(08)70356-X Karp, 1975, On the computational complexity of combinatorial problems, Networks, 5, 45, 10.1002/net.1975.5.1.45 Khachian, 1979, A polynomial algorithm in linear programming, Soviet Math. Dokl., 20, 191 Lageweg, 1981, Computer aided complexity classification of deterministic scheduling problems Slowinski, 1980, Two approaches to problems of resource allocation among project activities — a comparative study, J. Operational Res. Soc., 31, 711 Ullman, 1976, Complexity of sequencing problems, 139 Weglarz, 1977, Algorithm 520: an automatic revised simplex method for constrained resource network scheduling, ACM Trans. Math. Software, 3, 295, 10.1145/355744.355755